AbstractWe shall provide a ‘simple’ algorithm allowing, with formal power series, to decide whether a rational subset of Nk, given by an ambiguous rational expression, is recognizable
AbstractA well-known construction associates to each rational subset of Nk a rational function in k ...
Given a direct product of monoids $M=A^*\times \N^m$ where $A$ is finite and $\N$ is the additive mo...
AbstractWe give a method to decide whether or not the image of a given N-rational sequence can be re...
AbstractWe shall provide a ‘simple’ algorithm allowing, with formal power series, to decide whether ...
AbstractStarting from an idea of Harju and Karhumäki (1991), we prove the decidability of the equiva...
AbstractWe use language theory to study the rational subset problem for groups and monoids. We show ...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
Some results are given in the theory of rational power series over a broad class of semirings. In pa...
AbstractBy extending the axiom system for equalities between rational (or recognizable) sets by Salo...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
Partially lossy queue monoids (or plq monoids) model the behavior of queues that can forget arbitrar...
AbstractA well-known construction associates to each rational subset of Nk a rational function in k ...
Given a direct product of monoids $M=A^*\times \N^m$ where $A$ is finite and $\N$ is the additive mo...
AbstractWe give a method to decide whether or not the image of a given N-rational sequence can be re...
AbstractWe shall provide a ‘simple’ algorithm allowing, with formal power series, to decide whether ...
AbstractStarting from an idea of Harju and Karhumäki (1991), we prove the decidability of the equiva...
AbstractWe use language theory to study the rational subset problem for groups and monoids. We show ...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
Some results are given in the theory of rational power series over a broad class of semirings. In pa...
AbstractBy extending the axiom system for equalities between rational (or recognizable) sets by Salo...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
We consider the four families of recognizable, synchronous, deterministic rational and rational subs...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
Partially lossy queue monoids (or plq monoids) model the behavior of queues that can forget arbitrar...
AbstractA well-known construction associates to each rational subset of Nk a rational function in k ...
Given a direct product of monoids $M=A^*\times \N^m$ where $A$ is finite and $\N$ is the additive mo...
AbstractWe give a method to decide whether or not the image of a given N-rational sequence can be re...
DOI
Add to ORKG