Undecidability of state complexity
From MaRDI portal
Publication:2855756
DOI10.1080/00207160.2012.704994zbMath1401.68167OpenAlexW2145436131MaRDI QIDQ2855756
Kai Salomaa, Arto Salomaa, Sheng Yu
Publication date: 22 October 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.704994
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- State complexity of combined operations with two basic operations
- Descriptional and computational complexity of finite automata -- a survey
- Implementation and application of automata. 16th international conference, CIAA 2011, Blois, France, July 13--16, 2011. Proceedings
- On the state complexity of reversals of regular languages
- The state complexity of \(L^{2}\) and \(L^k\)
- State complexity of basic language operations combined with reversal
- State complexity of power
- The state complexities of some basic operations on regular languages
- State complexity of some operations on binary regular languages
- Estimation of state complexity of combined operations
- State complexity of combined operations
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- State Complexity of Catenation Combined with Union and Intersection
- Undecidability of State Complexities Using Mirror Images
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- State complexity of cyclic shift
- A Second Course in Formal Languages and Automata Theory
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
This page was built for publication: Undecidability of state complexity
