Operational union-complexity

DOI10.1016/j.ic.2021.104692OpenAlexW3119468547MaRDI QIDQ2113386

Benedek Nagy

Publication date: 14 March 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104692

zbMATH Keywords

regular languagesunion-complexityunion-free languagesregular operations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Union-complexities of Kleene plus operation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incomplete operational transition complexity of regular languages
• Most complex deterministic union-free regular languages
• Algorithms for determining relative star height and star height
• On equations for union-free regular languages
• Union-freeness, deterministic union-freeness and union-complexity
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
• On Union-Free and Deterministic Union-Free Languages
• Transition Complexity of Incomplete DFAs
• On the Number of Accepting States of Finite Automata
• A Second Course in Formal Languages and Automata Theory
• Minimal Union-Free Decompositions of Regular Languages
• Structure and Complexity of Some Subregular Language Families
• Isometries on positive operators of unit norm
• The Ranges of Accepting State Complexities of Languages Resulting from Some Operations

This page was built for publication: Operational union-complexity