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

DOI10.1007/978-3-030-79121-6_8MaRDI QIDQ2117666zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Kleene star on unary regular languages
• Magic numbers and ternary alphabet
• Magic numbers in the state hierarchy of finite automata
• On the Krohn-Rhodes cascaded decomposition theorem
• On the square of regular languages
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• The range of state complexities of languages resulting from the cut operation
• Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs

Cited in

(8)

• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• On the descriptional complexity of the direct product of finite automata
• State complexity of binary coded regular languages
• State complexity of binary coded regular languages
• The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
• On the accepting state complexity of operations on permutation automata
• On the accepting state complexity of operations on permutation automata
• More on the descriptional complexity of products of finite automata

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

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