Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages

DOI10.1142/s0129054121410070zbMath1522.68280OpenAlexW3166119034MaRDI QIDQ6169889

Benedek Nagy

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054121410070

zbMATH Keywords

closure propertiessubregular languagesunion-complexityunion-free languages1CFP automataunion-decomposition

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Union-complexities of Kleene plus operation

Cites Work

• Unnamed Item
• Unnamed Item
• Most complex deterministic union-free regular languages
• On equations for union-free regular languages
• Operational union-complexity
• Union-freeness, deterministic union-freeness and union-complexity
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
• On Union-Free and Deterministic Union-Free Languages
• Minimal Union-Free Decompositions of Regular Languages
• Structure and Complexity of Some Subregular Language Families
• Expressive capacity of subregular expressions
• Isometries on positive operators of unit norm

This page was built for publication: Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages