State complexity of unique rational operations

Authors:
Narad Rampersad;Nicolae Santean;Jeffrey Shallit;Bala Ravikumar
Affiliations:
School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada;School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada;School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, ON N2L 3G1, Canada;Department of Computer Science, Sonoma State University, 1801 East Cotati Avenue, Rohnert Park, CA 94928, USA
Venue:
Theoretical Computer Science
Year:
2009

Citing 21
Cited 1

Relating the type of ambiguity of finite automata to the succinctness of their representation

SIAM Journal on Computing
A note on the space complexity of some decision problems for finite automata

Information Processing Letters
Intersection and union of regular languages and state complexity

Information Processing Letters
The state complexities of some basic operations on regular languages

Theoretical Computer Science
On language equations with invertible operations

Theoretical Computer Science
Complexity results for two-way and multi-pebble automata and their logics

ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Regular languages

Handbook of formal languages, vol. 1
Communication complexity method for measuring nondeterminism in finite automata

Information and Computation
Handbook of Formal Languages

Handbook of Formal Languages
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Tight lower bound for the state complexity of shuffle of regular languages

Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Submodule Construction and Supervisory Control: A Generalization

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
On the state complexity of reversals of regular languages

Theoretical Computer Science
The state complexity of L2 and Lk

Information Processing Letters
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
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
Ambiguity in Graphs and Expressions

IEEE Transactions on Computers
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

On language decompositions and primality

Rainbow of computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

For each basic language operation we define its ''unique'' counterpart as being the operation that results in a language whose words can be obtained uniquely through the given operation. These unique operations can arguably be viewed as combined basic operations, placing this work in the popular area of state complexity of combined operations on regular languages. We study the state complexity of unique rational operations and we provide upper bounds and empirical results meant to cast light into this matter. Equally important, we hope to have provided a generic methodology for estimating their state complexity.