Finite automata and unary languages
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Algorithmic number theory
Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State complexity of combined operations
Theoretical Computer Science
On the average state and transition complexity of finite languages
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Provably Shorter Regular Expressions from Deterministic Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
State Complexity of Combined Operations for Prefix-Free Regular Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
State complexity of combined operations with two basic operations
Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
| Hi-index | 0.01 |
We examine the state complexity of proportional removals such as ½(L). For ½(L), we show a bound which is tight in the case that L is a unary language, and an nearly optimal bound for arbitrary languages. We also compute the average state complexity for ½(L) if L is unary. We study other proportional removals and give bounds for certain reset automata.