Rational relations and rational series
From MaRDI portal
Publication:1194313
DOI10.1016/0304-3975(92)90375-PzbMath0777.68068MaRDI QIDQ1194313
Publication date: 27 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semirings (16Y60)
Related Items
DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA, The equality problem for rational series with multiplicities in the tropical semiring is undecidable
Cites Work
- Limitedness theorem on finite automata with distance functions
- On the decidability of some problems about rational subsets of free partially commutative monoids
- La finitude des représentations linéaires des semi-groupes est decidable
- On the definition of a family of automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Characterizations of the decidability of some problems for regular trace languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item