Exponential upper and lower bounds for the order of a regular language
From MaRDI portal
Publication:1341751
DOI10.1016/0304-3975(94)90288-7zbMath0823.68049OpenAlexW2010387529MaRDI QIDQ1341751
Publication date: 9 January 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90288-7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- A decision procedure for the order of regular events
- Finite-valued distance automata
- Distance automata having large finite distance or finite ambiguity
- On semigroups of matrices over the tropical semiring
- On finite automata with limited nondeterminism (extended abstract)
- On finitely generated monoids of matrices with entries in $\mathbb {N}$
