Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2015: Descriptional Complexity of Formal Systems pp 185–196Cite as

Complement on Free and Ideal Languages

  • Conference paper
  • First Online:

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

Abstract

We study nondeterministic state complexity of the complement operation on the classes of prefix-free, suffix-free, factor-free and subword-free languages and on the class of ideal languages. For the cases prefix-free and suffix-free we improve the lower bound, and improve the upper bound for suffix-free languages in the binary case. In all other cases, we find tight bounds for sufficient alphabet sizes.

P. Mlynárčik—Research supported by VEGA grant 2/0084/15.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Birget, J.C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoret. Comput. Sci. 119, 267–291 (1993). ERRATUM: Partial orders on words, minimal elements of regular languages, and state complexity (2002). http://clam.rutgers.edu/birget/papers.html

    Article  MATH  MathSciNet  Google Scholar 

  2. Cmorik, R., Jirásková, G.: Basic operations on binary suffix-free languages. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94–102. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087–1102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Jirásková, G.: Note on minimal automata and uniform communication protocols. In: Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, and Back: Essays in Honour of Gheorghe Paun, pp. 163–170. Taylor and Francis (2003)

    Google Scholar 

  7. Jirásková, G., Mlynárčik, P.: Complement on prefix-free, suffix-free, and non-returning NFA languages. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 222–233. Springer, Heidelberg (2014)

    Google Scholar 

  8. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 275–286 (1978)

    Google Scholar 

  10. Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company, Boston (1997)

    MATH  Google Scholar 

Download references

Acknowledgements

I would like to thank to Galina Jirásková for many helpful discussions which led to writing this article.

Author information

Authors and Affiliations

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

    Peter Mlynárčik

Authors
  1. Peter Mlynárčik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Mlynárčik .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

    Jeffrey Shallit

  2. Department of Mathematics, University of Turku, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mlynárčik, P. (2015). Complement on Free and Ideal Languages. In: Shallit, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2015. Lecture Notes in Computer Science(), vol 9118. Springer, Cham. https://doi.org/10.1007/978-3-319-19225-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19225-3_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19224-6

  • Online ISBN: 978-3-319-19225-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation