State complexity of prefix, suffix, bifix and infix operators on regular languages

Authors:
Elena V. Pribavkina;Emanuele Rodaro
Affiliations:
Ural State University, Ekaterinburg, Russia;Departemento de Matematica, Facultade de Ciências, Universidade do Porto, Porto, Portugal
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 13
Cited 0

Intersection and union of regular languages and state complexity

Information Processing Letters
State complexity 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
Unary Language Concatenation and Its State Complexity

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
State complexity of some operations on binary regular languages

Theoretical Computer Science - Descriptional complexity of formal systems
Synchronizing Automata and the Černý Conjecture

Language and Automata Theory and Applications
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Fundamenta Informaticae
State Complexity of Combined Operations for Prefix-Free Regular Languages

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Finitely Generated Synchronizing Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
State complexity of basic operations on suffix-free regular languages

Theoretical Computer Science
On NFAs where all states are final, initial, or both

Theoretical Computer Science
Codes and Automata (Encyclopedia of Mathematics and its Applications)

Codes and Automata (Encyclopedia of Mathematics and its Applications)
Quotient complexity of ideal languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider four operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix and infix) out of a given regular language. We give the precise values of the (deterministic) state complexity of each of these operators.