Skip to main content
Springer Nature Link
Log in

Most Complex Deterministic Union-Free Regular Languages

  • Conference paper
  • First Online:
Descriptional Complexity of Formal Systems (DCFS 2018)

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

Included in the following conference series:

  • 306 Accesses

Abstract

A regular language L is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jirásková and Masopust proved that the state complexities of the basic operations reversal, star, product, and boolean operations in deterministic union-free languages are exactly the same as those in the class of all regular languages. To prove that the bounds are met they used five types of automata, involving eight types of transformations of the set of states of the automata. We show that for each \(n \geqslant 3\) there exists one ternary witness of state complexity n that meets the bound for reversal and product. Moreover, the restrictions of this witness to binary alphabets meet the bounds for star and boolean operations. We also show that the tight upper bounds on the state complexity of binary operations that take arguments over different alphabets are the same as those for arbitrary regular languages. Furthermore, we prove that the maximal syntactic semigroup of a union-free language has \(n^n\) elements, as in the case of regular languages, and that the maximal state complexities of atoms of union-free languages are the same as those for regular languages. Finally, we prove that there exists a most complex union-free language that meets the bounds for all these complexity measures. Altogether this proves that the complexity measures above cannot distinguish union-free languages from regular languages.

This work was supported by the Natural Sciences and Engineering Research Council of Canada grant No. OGP0000871.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Terminology changed to that of the present paper.

References

  1. Afonin, S., Golomazov, D.: Minimal union-free decompositions of regular languages. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 83–92. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00982-2_7

    Chapter  Google Scholar 

  2. Bell, J., Brzozowski, J., Moreira, N., Reis, R.: Symmetric groups and quotient complexity of boolean operations. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 1–12. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43951-7_1

    Chapter  MATH  Google Scholar 

  3. Brzozowski, J.A.: Regular expression techniques for sequential circuits. Ph.D. thesis, Princeton University, Princeton, NJ (1962). http://maveric.uwaterloo.ca/~brzozo/publication.html

  4. Brzozowski, J.A.: In search of the most complex regular languages. Int. J. Found. Comput. Sci. 24(6), 691–708 (2013)

    Article  MathSciNet  Google Scholar 

  5. Brzozowski, J.A., Davies, S.: Quotient complexities of atoms of regular ideal languages. Acta Cybern. 22, 293–311 (2015)

    Article  MathSciNet  Google Scholar 

  6. Brzozowski, J.A., Davies, S., Liu, B.Y.V.: Most complex regular ideal languages. Discrete Math. Theor. Comput. Sci. 18(3) (2016). Paper #15

    Google Scholar 

  7. Brzozowski, J.A., Sinnamon, C.: Unrestricted state complexity of binary operations on regular and ideal languages (2016). http://arxiv.org/abs/1609.04439. Accessed 2017

  8. Brzozowski, J.A., Sinnamon, C.: Complexity of right-ideal, prefix-closed, and prefix-free regular languages. Acta Cybern. 23(1), 9–41 (2017)

    Article  MathSciNet  Google Scholar 

  9. Brzozowski, J.A., Sinnamon, C.: Unrestricted state complexity of binary operations on regular and ideal languages. J. Autom. Lang. Comb. 22(1–3), 29–59 (2017)

    MathSciNet  MATH  Google Scholar 

  10. Brzozowski, J.A., Szykuła, M.: Large aperiodic semigroups. Int. J. Found. Comput. Sci. 26(7), 913–931 (2015)

    Article  MathSciNet  Google Scholar 

  11. Brzozowski, J.A., Tamm, H.: Complexity of atoms of regular languages. Int. J. Found. Comput. Sci. 24(7), 1009–1027 (2013)

    Article  MathSciNet  Google Scholar 

  12. Brzozowski, J.A., Tamm, H.: Theory of átomata. Theor. Comput. Sci. 539, 13–27 (2014)

    Article  Google Scholar 

  13. Crvenković, S., Dolinka, I., Ésik, Z.: On equations for union-free regular languages. Inf. Comput. 164, 152–172 (2001)

    Article  MathSciNet  Google Scholar 

  14. Davies, S.: A new technique for reachability of states in concatenation automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10316, pp. 75–87. Springer, Cham (2018). Earlier version at https://arxiv.org/abs/1710.05061

    Google Scholar 

  15. Holzer, M., Kutrib, M.: Structure and complexity of some subregular language families. In: Konstantinidis, S., Moreira, N., Reis, R., Shallit, J. (eds.) The Role of Theory in Computer Science, pp. 59–82. World Scientific, Singapore (2017)

    Chapter  Google Scholar 

  16. Iván, S.: Complexity of atoms, combinatorially. Inf. Process. Lett. 116(5), 356–360 (2016)

    Article  MathSciNet  Google Scholar 

  17. Jirásková, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22(7), 1639–1653 (2011)

    Article  MathSciNet  Google Scholar 

  18. Jirásková, G., Nagy, B.: On union-free and deterministic union-free languages. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 179–192. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33475-7_13

    Chapter  Google Scholar 

  19. Kutrib, M., Wendlandt, M.: Concatenation-free languages. Theor. Comput. Sci. 679(Suppl. C), 83–94 (2017)

    Article  MathSciNet  Google Scholar 

  20. Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194, 1266–1268 (1970). (in Russian). English translation: Soviet Math. Dokl. 11, 1373–1375 (1970)

    MathSciNet  Google Scholar 

  21. McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press, Cambridge (1971)

    MATH  Google Scholar 

  22. Nagy, B.: Union-free regular languages and 1-cycle-free-path-automata. Publ. Math. Debr. 68(1–2), 183–197 (2006)

    MathSciNet  MATH  Google Scholar 

  23. Nagy, B.: On union complexity of regular languages. In: CINTI 2010, pp. 177–182. IEEE (2010)

    Google Scholar 

  24. Pin, J.E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1: Word, Language, Grammar, pp. 679–746. Springer, New York (1997). https://doi.org/10.1007/978-3-642-59136-5_10

    Chapter  Google Scholar 

  25. Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320, 315–329 (2004)

    Article  MathSciNet  Google Scholar 

  26. Schützenberger, M.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)

    Article  MathSciNet  Google Scholar 

  27. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125, 315–328 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Janusz A. Brzozowski

  2. Department of Pure Mathematics, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Sylvie Davies

Authors
  1. Janusz A. Brzozowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvie Davies
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sylvie Davies .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, Nova Scotia, Canada

    Stavros Konstantinidis

  2. Dipartimento di Informatica e Comunicazi, Universita degli Studi di Milano, Milan, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Brzozowski, J.A., Davies, S. (2018). Most Complex Deterministic Union-Free Regular Languages. In: Konstantinidis, S., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science(), vol 10952. Springer, Cham. https://doi.org/10.1007/978-3-319-94631-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94631-3_4

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships