Skip to main content
SpringerLink
Log in

State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages

  • Conference paper
Developments in Language Theory (DLT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6224))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. In: Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  2. Birget, J.-C.: Intersection and union of regular languages and state complexity. Information Processing Letters 43, 185–190 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brzozowski, J., Jiraskova, G., Li, B.: Quotient complexity of ideal languages. In: Proceedings LATIN 2010 (to appear 2010), Available at CoRR, ArXiv:0908.2083 (2009)

    Google Scholar 

  4. Câmpeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 60–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami Mat.-Fyz. Mat.-Fyz. Čas. Slovensk. Akad. Vied. 14, 208–216 (1964)

    MATH  Google Scholar 

  6. Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoret. Comput. Sci. 410(27-29), 2537–2548 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundamenta Informaticae 90, 93–106 (2009)

    MATH  MathSciNet  Google Scholar 

  8. Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Ésik, Z., Fülöp, Z. (eds.) Automata, Formal Languages and Related Topics, Institute of Informatics, pp. 99–115. University of Szeged (2009)

    Google Scholar 

  9. Han, Y.-S., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 398–409. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Jirásková, G.: State complexity of some operations on binary regular languages. Theoret. Comput. Sci. 330, 287–298 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kao, J.-Y., Rampersad, N., Shallit, J.: On NFAs where all states are final, initial, or both. Theoret. Comput. Sci. 410, 5010–5021 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  12. Pighizzini, G.: Unary language concatenation and its state complexity. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 252–262. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthals function. Internat. J. Found. Comput. Sci. 13, 145–159 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Mateescu, A., Salomaa, A.: Many-valued truth functions, Černý’s conjecture and road coloring. EATCS Bull. 68, 134–150 (1999)

    MATH  MathSciNet  Google Scholar 

  15. Pribavkina, E.V., Rodaro, E.: Finitely generated synchronizing automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 672–683. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Volkov, M.V.: Synchronizing automata and the Černý conjecture. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11–27. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics 6(2), 221–234 (2001)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ural State University, 620083, Ekaterinburg, Russia

    Elena V. Pribavkina

  2. Departemento de Matematica, Facultade de Ciências Universidade do Porto, 4169-007, Porto, Portugal

    Emanuele Rodaro

Authors
  1. Elena V. Pribavkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emanuele Rodaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pribavkina, E.V., Rodaro, E. (2010). State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation