On biautomata

DOI10.1051/ita/2012014zbMath1279.68238OpenAlexW4239016597MaRDI QIDQ4649457

Ondřej Klíma, Libor Polák

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

zbMATH Keywords

piecewise testable languagesbiautomatacanonical biautomatonprefix-suffix languages

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (7)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs ⋮ Obituary: Libor Polák (1950--2020) ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ On linear languages recognized by deterministic biautomata ⋮ On shuffle products, acyclic automata and piecewise-testable languages ⋮ Characterization and complexity results on jumping finite automata

This page was built for publication: On biautomata