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

DOI10.1007/978-3-030-81508-0_19OpenAlexW3173264915MaRDI QIDQ832942

Markus Holzer, Christian Rauch

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ More on the descriptional complexity of products of finite automata ⋮ On the descriptional complexity of the direct product of finite automata ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Direct or cascade product of pushdown automata
• 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 cascade product -- the unary case (extended abstract)
• The range of state complexities of languages resulting from the cut operation
• Kleene Star on Unary Regular Languages
• MAGIC NUMBERS AND TERNARY ALPHABET
• On the Square of Regular Languages
• On the Krohn-Rhodes Cascaded Decomposition Theorem