The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
From MaRDI portal
Publication:2117666
DOI10.1007/978-3-030-79121-6_8OpenAlexW3209734528MaRDI QIDQ2117666FDOQ2117666
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
Cites Work
- Title not available (Why is that?)
- Magic numbers in the state hierarchy of finite automata
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- Magic numbers and ternary alphabet
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- The range of state complexities of languages resulting from the cut operation
- Kleene star on unary regular languages
- On the square of regular languages
- On the Krohn-Rhodes cascaded decomposition theorem
- The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
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)
