Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Handbook of formal languages, vol. 1
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A family of NFAs which need 2n - α deterministic states
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Descriptional complexity of determinization and complementation for finite automata
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Descriptional complexity of determinization and complementation for finite automata
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.00 |
We examine the deterministic and nondeterministic state complexity of complements, stars, and reversals of regular languages. Our results are as follows: 1The nondeterministic state complexity of the complement of an n-state NFA language over a five-letter alphabet may reach each value in the range from lognto 2n.1The state complexity of the star (reversal) of an n-state DFA language over a growing alphabet may reach each value in the range from 1 to $\frac{3}{4}2^n$ (from lognto 2n, respectively).1The nondeterministic state complexity of the star (reversal) of an n-state NFA binary language may reach each value in the range from 1 to n+ 1 (from n茂戮驴 1 to n+ 1, respectively).We also obtain some partial results on the nondeterministic state complexity of the complements of binary regular languages. As a bonus, we get an exponential number of values that are non-magic, which improves a similar result of Geffert (Proc. 7th DCFS, Como, Italy, 23---37).