Implementation and Application of Automata
From MaRDI portal
Publication:5463982
DOI10.1007/b105090zbMath1115.68443arXivmath/0306416OpenAlexW4302765085WikidataQ56387363 ScholiaQ56387363MaRDI QIDQ5463982
No author found.
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0306416
Related Items (8)
Complexity of suffix-free regular languages ⋮ Syntactic complexity of suffix-free languages ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ On deterministic finite automata and syntactic monoid size ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages
This page was built for publication: Implementation and Application of Automata