The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Automata
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the state complexity of reversals of regular languages
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of combined operations
Theoretical Computer Science
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
The state complexity of two combined operations, star of catenation and star of reversal, on regular languages is considered in this paper. Tight bounds are obtained for both combined operations. The results clearly show that the state complexity of a combined operation can be very different from the composition of the state complexities of its participating individual operations. A new approach for research in automata and formal language theory is also explained.