Most complex deterministic union-free regular languages

DOI10.1007/978-3-319-94631-3_4zbMath1435.68150arXiv1711.09149OpenAlexW2964270270MaRDI QIDQ777986

Sylvie Davies, Janusz A. Brzozowski

Publication date: 30 June 2020

Full work available at URL: https://arxiv.org/abs/1711.09149

zbMATH Keywords

regular languagetransition semigroupstate complexityreversalBoolean operationsyntactic semigroupdifferent alphabetsone-cycle-free-path automatonunion-free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Union-complexities of Kleene plus operation ⋮ Operational union-complexity

This page was built for publication: Most complex deterministic union-free regular languages