The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)

DOI10.1007/978-3-030-79121-6_8OpenAlexW3209734528MaRDI QIDQ2117666

Markus Holzer, Christian Rauch

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79121-6_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ On the accepting state complexity of operations on permutation automata ⋮ Unnamed Item ⋮ State complexity of binary coded regular languages ⋮ More on the descriptional complexity of products of finite automata ⋮ State complexity of binary coded regular languages ⋮ On the descriptional complexity of the direct product of finite automata

Cites Work

• Unnamed Item
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
• The range of state complexities of languages resulting from the cut operation
• Magic numbers in the state hierarchy of finite automata
• Kleene Star on Unary Regular Languages
• MAGIC NUMBERS AND TERNARY ALPHABET
• On the Square of Regular Languages
• On the Krohn-Rhodes Cascaded Decomposition Theorem
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

This page was built for publication: The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)