On Union-Free and Deterministic Union-Free Languages

DOI10.1007/978-3-642-33475-7_13MaRDI QIDQ2915169zbMATH OpenOpenAlexFDO

Authors Galina Jirásková, Benedek Nagy

Publication date 21 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33475-7_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
• Unions of certain bounded deterministic languages
• Complexity in Union-Free Regular Languages
• Complexity in union-free regular languages
• On the union of 0L languages
• Isometries on positive operators of unit norm
• Union-freeness, deterministic union-freeness and union-complexity
• On equations for union-free regular languages
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• Most complex deterministic union-free regular languages

Cited in

(10)

• On equations for union-free regular languages
• Union-complexities of Kleene plus operation
• Operational union-complexity
• Union-freeness, deterministic union-freeness and union-complexity
• Deterministic logics for UL
• Unions of certain bounded deterministic languages
• Minimal Union-Free Decompositions of Regular Languages
• Isometries on positive operators of unit norm
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
• On the union of 0L languages

This page was built for publication: On Union-Free and Deterministic Union-Free Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915169)