Skip to main content
SpringerLink
Log in

State Complexity of Finite Partial Languages

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13439))

Included in the following conference series:

  • 164 Accesses

Abstract

Partial word finite automata are deterministic finite automata that may have state transitions on a special symbol \(\diamond \) which represents an unknown symbol or a hole in the word. Together with a subset of the input alphabet that gives the symbols which may be substituted for the \(\diamond \), a partial word finite automaton (\(\diamond \text {-DFA}\)) represents a regular language. However, this substitution implies a certain form of limited nondeterminism in the computations when the \(\diamond \)-transitions are replaced by ordinary transitions. In this paper we consider the state complexity of partial word finite automata accepting finite languages. We study the state complexity of the \(\text {NFA}\) to \(\diamond \text {-DFA}\) conversion for finite languages as well as the state complexity of the \(\diamond \text {-DFA}\) to \(\text {DFA}\) conversion for finite languages. Then we consider the operational state complexity with respect to complementation, union, reversal, and concatenation of finite languages. It turns out that the upper and lower bounds for all these operations are exponential. Moreover, we establish a state complexity hierarchy on the number of productive \(\diamond \)-transitions that may appear in \(\diamond \text {-DFA}\)s accepting finite languages. The levels of the hierarchy are separated by quadratic state costs.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

References

  1. Balkanski, E., Blanchet-Sadri, F., Kilgore, M., Wyatt, B.J.: On the state complexity of partial word DFAs. Theory Comput. Sci. 578, 2–12 (2015)

    Article  MathSciNet  Google Scholar 

  2. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theory Comput. Sci. 218, 135–141 (1999)

    Article  MathSciNet  Google Scholar 

  3. Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)

    Article  MathSciNet  Google Scholar 

  4. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. CRC Press, Discrete mathematics and its applications (2008)

    Google Scholar 

  5. Blanchet-Sadri, F., Goldner, K., Shackleton, A.: Minimal partial languages and automata. RAIRO Inform. Théor. 51, 99–119 (2017)

    Article  MathSciNet  Google Scholar 

  6. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 677–691 (1986)

    Article  Google Scholar 

  7. 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). https://doi.org/10.1007/3-540-45526-4_6

    Chapter  Google Scholar 

  8. Câmpeanu, C., Ho, W.H.: The maximum state complexity for finite languages. J. Autom. Lang. Comb. 9, 189–202 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Câmpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theory Comput. Sci. 267, 3–16 (2001)

    Article  MathSciNet  Google Scholar 

  10. Champarnaud, J., Pin, J.: A maxmin problem on finite automata. Discrete Appl. Math. 23, 91–96 (1989)

    Article  MathSciNet  Google Scholar 

  11. Dassow, J., Manea, F., Mercaş, R.: Regular languages of partial words. Inf. Sci. 268, 290–304 (2014)

    Article  MathSciNet  Google Scholar 

  12. Fischer, M.J., Paterson, M.S.: String-matching and other products. In: Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 113–125. AMS (1974)

    Google Scholar 

  13. Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Comb. 21, 251–310 (2016)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Han, Y.S., Salomaa, K.: State complexity of union and intersection of finite languages. Int. J. Found. Comput. Sci. 19, 581–595 (2008)

    Article  MathSciNet  Google Scholar 

  16. Holzer, M., Jakobi, S., Wendlandt, M.: On the computational complexity of partial word automata problems. Fund. Inform. 148, 267–289 (2016)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  18. Holzer, M., Kutrib, M.: Nondeterministic finite automata-recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci. 20, 563–580 (2009)

    Article  MathSciNet  Google Scholar 

  19. Kutrib, M., Wendlandt, M.: State complexity of partial word finite automata. In: Han, Y.S., Ko, S.K. (eds) DCFS 2021. LNCS, vol. 13037. pp. 113–124. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-93489-7_10

  20. Mandl, R.: Precise bounds associated with the subset construction on various classes of nondeterministic finite automata. In: Princeton Conference on Information Sciences and Systems (CISS 1973), pp. 263–267 (1973)

    Google Scholar 

  21. Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theory Comput. Sci. 92, 181–189 (1992)

    Article  MathSciNet  Google Scholar 

  22. Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom. Lang. Comb. 2, 177–186 (1997)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib & Matthias Wendlandt

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Wendlandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Kutrib .

Editor information

Editors and Affiliations

  1. Yonsei University, Seoul, Korea (Republic of)

    Yo-Sub Han

  2. University of Debrecen, Debrecen, Hungary

    György Vaszil

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kutrib, M., Wendlandt, M. (2022). State Complexity of Finite Partial Languages. In: Han, YS., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2022. Lecture Notes in Computer Science, vol 13439. Springer, Cham. https://doi.org/10.1007/978-3-031-13257-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-13257-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-13256-8

  • Online ISBN: 978-3-031-13257-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation