Complexity in Union-Free Regular Languages

DOI10.1007/978-3-642-14455-4_24MaRDI QIDQ3584898zbMATH OpenOpenAlexFDO

Authors 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

deterministic union-free languages as languagesone-cycle-free-path deterministic finite automataregular expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Complexity in union-free regular languages
• Most complex deterministic union-free regular languages
• Complexity of suffix-free regular languages
• Complexity of suffix-free regular languages
• scientific article; zbMATH DE number 7315105
• On equations for union-free regular languages
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• Intersection and union of regular languages and state complexity
• Minimal Union-Free Decompositions of Regular Languages

Cited in

(19)

• On classes of tractable unrestricted regular expressions
• On equations for union-free regular languages
• Operational union-complexity
• Union-freeness, deterministic union-freeness and union-complexity
• Concatenation-free languages
• Networks of evolutionary processors: the power of subregular filters
• Complexity in union-free regular languages
• On Union-Free and Deterministic Union-Free Languages
• Expressive capacity of concatenation freeness
• Unions of certain bounded deterministic languages
• Minimal Union-Free Decompositions of Regular Languages
• 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
• Isometries on positive operators of unit norm
• Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages
• Most complex deterministic union-free regular languages

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

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