Complexity in Union-Free Regular Languages

DOI10.1007/978-3-642-14455-4_24zbMath1205.68205OpenAlexW2165473220MaRDI QIDQ3584898

Galina Jirásková, Tomáš Masopust

Publication date: 31 August 2010

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_24

zbMATH Keywords

regular expressionsdeterministic union-free languages as languagesone-cycle-free-path deterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Networks of evolutionary processors: the power of subregular filters ⋮ Nondeterministic state complexity of star-free languages ⋮ On external contextual grammars with subregular selection languages ⋮ Reversal of binary regular languages ⋮ Nondeterministic State Complexity of Star-Free Languages ⋮ Note on Reversal of Binary Regular Languages

This page was built for publication: Complexity in Union-Free Regular Languages