On varieties of meet automata
From MaRDI portal
Publication:955003
DOI10.1016/j.tcs.2008.06.005zbMath1154.68070MaRDI QIDQ955003
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.005
68Q45: Formal languages and automata
Related Items
Shuffle product of regular languages: results and open problems, Coalgebraic constructions of canonical nondeterministic automata, Syntactic structures of regular languages, Obituary: Libor Polák (1950--2020), Hierarchies of Piecewise Testable Languages, HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES
Cites Work