Skip to main content
SpringerLink
Log in

Basic Operations on Binary Suffix-Free Languages

  • Conference paper
Mathematical and Engineering Methods in Computer Science (MEMICS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7119))

Abstract

We give a characterization of nondeterministic automata accepting suffix-free languages, and a sufficient condition on deterministic automata to accept suffix-free languages. Then we investigate the state complexity of basic operations on binary suffix-free regular languages. In particular, we show that the upper bounds on the state complexity of all the boolean operations as well as of Kleene star are tight in the binary case. On the other hand, we prove that the bound for reversal cannot be met by binary languages. This solves several open questions stated by Han and Salomaa (Theoret. Comput. Sci. 410, 2537-2548, 2009).

Supported by VEGA grants 1/0035/09 and 2/0183/11, and grant APVV-0035-10.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Bordihn, H., Holzer, M., Kutrib, M.: Determinization of finite automata accepting subregular languages. Theoret. Comput. Sci. 410, 3209–3222 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529–561. Polytechnic Press, Polytechnic Institute of Brooklyn, NY (1962)

    Google Scholar 

  3. Brzozowski, J., Jirásková, G., Li, B.: Quotient complexity of ideal languages. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 208–221. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Brzozowski, J., Jirásková, G., Zou, C.: Quotient complexity of closed languages. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol. 6072, pp. 84–95. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Câmpeanu, C., Salomaa, K., Culik II, 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 

  6. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986); Erratum: Theoret. Comput. Sci. 302, 497–498 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99–115. University of Szeged, Hungary (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Jirásková, G., Olejár, P.: State complexity of intersection and union suffix-free languages and descriptional complexity. In: Bordihn, H., Freund, R., Holzer, M., Kutrib, M., Otto, F. (eds.) NCMA 2009, pp. 151–166. Osterreichische Computer Gesellschaft (2009)

    Google Scholar 

  10. Jirásková, G., Masopust, T.: Complexity in union-free regular languages. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 255–266. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Res. Develop. 3, 114–129 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. Šebej, J.: Reversal of regular languages and state complexity. In: Pardubská, D. (ed.) ITAT 2010, pp. 47–54. P. J. Šafárik University of Košice, Slovakia (2010)

    Google Scholar 

  13. Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

  14. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, ch. 2, pp. 41–110. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, P.J. Šafárik University, Jesenná 5, 041 54, Košice, Slovakia

    Roland Cmorik

  2. Mathematical Institute, Slovak Academy of Sciences, Grešákova 6, 040 01, Košice, Slovakia

    Galina Jirásková

Authors
  1. Roland Cmorik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Galina Jirásková
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 612 66, Brno, Czech Republic

    Zdeněk Kotásek , Lukáš Sekanina  & Tomáš Vojnar ,  & 

  2. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Jan Bouda  & Ivana Černá  & 

  3. Institute of Computer Science, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    David Antoš

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cmorik, R., Jirásková, G. (2012). Basic Operations on Binary Suffix-Free Languages. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds) Mathematical and Engineering Methods in Computer Science. MEMICS 2011. Lecture Notes in Computer Science, vol 7119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25929-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25929-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25928-9

  • Online ISBN: 978-3-642-25929-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation