State complexity of basic language operations combined with reversal

Authors:
Guangwu Liu;Carlos Martin-Vide;Arto Salomaa;Sheng Yu
Affiliations:
School of Transportation, Wuhan University of Technology, 430063 Wuhan, People's Republic of China and Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Plaza Imperial Tarr ...;Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Plaza Imperial Tarraco, 1, 43005 Tarragona, Spain;Turku Centre for Computer Science, Joukahaisenkatu 3-5 B, 20520 Turku, Finland;Department of Computer Science, University of Western Ontario, London, Ont., Canada N6A 5B7
Venue:
Information and Computation
Year:
2008

Citing 12
Cited 13

The state complexities of some basic operations on regular languages

Theoretical Computer Science
Mastering regular expressions

Mastering regular expressions
Regular languages

Handbook of formal languages, vol. 1
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Theory of Automata

Theory of Automata
On the state complexity of reversals of regular languages

Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
An Introduction to Formal Language and Automata

An Introduction to Formal Language and Automata
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
Multiple-entry finite automata

Journal of Computer and System Sciences

State complexity of power

Theoretical Computer Science
Estimation of state complexity of combined operations

Theoretical Computer Science
State complexity of catenation combined with union and intersection

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
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
State complexity of union and intersection of star on k regular languages

Theoretical Computer Science
State complexity of the concatenation of regular tree languages

Theoretical Computer Science
State complexity of combined operations with two basic operations

Theoretical Computer Science
On the State Complexity of Star of Union and Star of Intersection

Fundamenta Informaticae
Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Fundamenta Informaticae
State complexity of union and intersection of square and reversal on k regular languages

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
State complexity of star of union and square of union on k regular languages

Theoretical Computer Science
Universal witnesses for state complexity of basic operations combined with reversal

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the state complexity of combined operations on regular languages. Each of the combined operations is a basic operation combined with reversal. We show that their state complexities are all very different from the compositions of state complexities of individual operations.