On biautomata
From MaRDI portal
Publication:4649457
DOI10.1051/ita/2012014zbMath1279.68238MaRDI QIDQ4649457
Publication date: 22 November 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/650bb5465dff348f0371742a0487c932cfd71ffa
68Q70: Algebraic theory of languages and automata
Related Items
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines, On shuffle products, acyclic automata and piecewise-testable languages, Characterization and complexity results on jumping finite automata, Obituary: Libor Polák (1950--2020), On linear languages recognized by deterministic biautomata, On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs, Jumping Finite Automata: Characterizations and Complexity