Union-complexities of Kleene plus operation

DOI10.1007/978-3-031-13257-5_15OpenAlexW4298410021MaRDI QIDQ2112193

Benedek Nagy

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_15

zbMATH Keywords

regular expressionsKleene closureunion-complexityunion-free languages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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
• A Second Course in Formal Languages and Automata Theory
• 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
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages

This page was built for publication: Union-complexities of Kleene plus operation