The state complexity of star-complement-star
Formal Languages and Automata Theory
2012-03-27 v1
Abstract
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.
Cite
@article{arxiv.1203.5353,
title = {The state complexity of star-complement-star},
author = {Galina Jiraskova and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1203.5353},
year = {2012}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
Nondeterministic State Complexity for Suffix-Free Regular Languages
Yo-Sub Han, Kai Salomaa
2010-08-11
Formal Languages and Automata Theory · Computer Science
Quotient Complexity of Star-Free Languages
Janusz Brzozowski, Bo Liu
2010-12-20
Formal Languages and Automata Theory · Computer Science
State complexity of union and intersection combined with star and reversal
Yuan Gao, Sheng Yu
2010-06-21
Formal Languages and Automata Theory · Computer Science
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star
Janusz Brzozowski, David Liu
2012-07-10
Formal Languages and Automata Theory · Computer Science
A General Approach to State Complexity of Operations: Formalization and Limitations
Sylvie Davies
2018-09-07
Formal Languages and Automata Theory · Computer Science
Syntactic Complexity of Star-Free Languages
Janusz Brzozowski, Baiyu Li
2011-09-16
Formal Languages and Automata Theory · Computer Science
State Complexity Investigations on Commutative Languages -- The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages
Stefan Hoffmann
2021-11-29
Formal Languages and Automata Theory · Computer Science
Operations on Automata with All States Final
Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský +1
2014-05-23
Formal Languages and Automata Theory · Computer Science
A Survey on Operational State Complexity
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
2015-09-11
Group Theory · Mathematics
State Complexity and the Monoid of Transformations of a Finite Set
Bryan Krawetz, John Lawrence, Jeffery Shallit
2007-05-23
Formal Languages and Automata Theory · Computer Science
State complexity of orthogonal catenation
Mark Daley, Michael Domaratzki, Kai Salomaa
2009-04-23
Formal Languages and Automata Theory · Computer Science
Descriptional Complexity of Finite Automata -- Selected Highlights
Arto Salomaa, Kai Salomaa, Taylor J. Smith
2026-04-08
Formal Languages and Automata Theory · Computer Science
State Complexity of Pattern Matching in Regular Languages
Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan
2018-11-06
Formal Languages and Automata Theory · Computer Science
Quotient complexity of ideal languages
J. Brzozowski, G. Jirásková, B. Li
2009-08-17
Formal Languages and Automata Theory · Computer Science
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal
Janusz Brzozowski, David Liu
2012-07-04
Formal Languages and Automata Theory · Computer Science
Quotient Complexity of Closed Languages
J. Brzozowski, G. Jirásková, C. Zou
2015-05-14
Formal Languages and Automata Theory · Computer Science
Incomplete Transition Complexity of Basic Operations on Finite Languages
Eva Maia, Nelma Moreira, Rogério Reis
2013-02-05
Formal Languages and Automata Theory · Computer Science
On the state complexity of closures and interiors of regular languages with subwords and superwords
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
2015-12-02
Formal Languages and Automata Theory · Computer Science
Complexity in Prefix-Free Regular Languages
Galina Jirásková, Monika Krausová
2010-08-11
Formal Languages and Automata Theory · Computer Science
Operational State Complexity of Block Languages
Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis
2024-09-12
Formal Languages and Automata Theory · Computer Science
State Complexity of Catenation Combined with Star and Reversal
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2010-08-11
Formal Languages and Automata Theory · Computer Science
State Complexity Bounds for the Commutative Closure of Group Languages
Stefan Hoffmann
2020-08-14
Formal Languages and Automata Theory · Computer Science
Towards a Theory of Complexity of Regular Languages
Janusz A. Brzozowski
2017-02-17
Formal Languages and Automata Theory · Computer Science
State complexity of catenation combined with a boolean operation: a unified approach
Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou
2015-05-14
Formal Languages and Automata Theory · Computer Science
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints
Stefan Hoffmann
2021-08-17