Universal witnesses for state complexity of basic operations combined with reversal

Authors:
Janusz Brzozowski;David Liu
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada;Department of Computer Science, University of Toronto, Toronto, ON, Canada
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 7
Cited 0

State complexity of regular languages

Journal of Automata, Languages and Combinatorics
On the state complexity of reversals of regular languages

Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal

Fundamenta Informaticae
State complexity of basic language operations combined with reversal

Information and Computation
State complexity of combined operations with two basic operations

Theoretical Computer Science
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
In search of most complex regular languages

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the state complexity of boolean operations, concatenation, and star, with one or two of the argument languages reversed. We derive tight upper bounds for the symmetric differences and differences of such languages. We prove that the previously discovered bounds for union, intersection, concatenation and star of such languages can all be met by the recently introduced universal witness and its variants.