More on the descriptional complexity of products of finite automata

DOI10.1007/978-3-030-93489-7_7OpenAlexW4206762480MaRDI QIDQ2096585

Christian Rauch, Markus Holzer

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_7

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On Jaffe's pumping lemma, revisited, On the descriptional complexity of the direct product of finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• 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
• MAGIC NUMBERS AND TERNARY ALPHABET
• On the Square of Regular Languages
• Algebraic Theory of Automata Networks
• State Complexity of Projected Languages