The state complexities of some basic operations on regular languages
Theoretical Computer Science
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
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 shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
State complexity of combined operations
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Reversal of binary regular languages
Theoretical Computer Science
On the State Complexity of Star of Union and Star of Intersection
Fundamenta Informaticae
| Hi-index | 5.23 |
We investigate the state complexity of combined operations for suffix-free regular languages. Suffix-free deterministic finite-state automata have a unique structural property that is crucial for obtaining the precise state complexity of basic operations. Based on the same property, we establish the state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation. In the case of star-of-intersection, we only have an upper bound and the lower bound is open.