Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6224 LNCS 376-386
DOI: 10.1007/978-3-642-14455-4_34
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Pribavkina, E. V., & Rodaro, E. (2010). State complexity of prefix, suffix, bifix and infix operators on regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6224 LNCS, pp. 376–386). https://doi.org/10.1007/978-3-642-14455-4_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free