Skip to main content
SpringerLink
Log in

Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2018)

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

  • 462 Accesses

Abstract

In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.

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 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

Institutional subscriptions

References

  1. Kohavi, Z., Jha, N.K.: Switching and Finite Automata Theory. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  2. Calazans, N.L.: State minimization and state assignment of finite state machines: their relationship and their impact on the implementation. PhD thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1993)

    Google Scholar 

  3. Benini, L., De Micheli, G.: State assignment for low power dissipation. IEEE J. Solid-State Circuits 30(3), 258–268 (1995)

    Article  Google Scholar 

  4. Kajstura, K., Kania, D.: Low power synthesis of finite state machines–state assignment decomposition algorithm. J. Circuits Syst. Comput. 27, 1850041 (2017)

    Article  Google Scholar 

  5. Valdats, M.: Transition function complexity of finite automata. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 301–313. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22600-7_24

    Chapter  Google Scholar 

  6. Valdats, M.: Boolean circuit complexity of regular languages. In: International Conference on Automata and Formal Languages. EPTCS, vol. 151, pp. 342–354 (2014)

    Google Scholar 

  7. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Automata Lang. Comb. 7(4), 469–486 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Wegener, I.: The Complexity of Boolean Functions. Wiley, New York (1987)

    MATH  Google Scholar 

  9. Lupanov, O.: Asymptotic estimates of the complexity of control systems. Moscow State University (1984). (in Russian)

    Google Scholar 

  10. Tarjan, R.E.: Complexity of monotone networks for computing conjunctions. Ann. Discret. Math. 2, 121–133 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lozano, A., Balcázar, J.L.: The complexity of graph problems for succinctly represented graphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 277–286. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-52292-1_20

    Chapter  Google Scholar 

  12. Balcázar, J.L., Lozano, A., Torán, J.: The complexity of algorithmic problems on succinct instances. In: Baeza-Yates, R., Manber, U. (eds.) Computer Science, pp. 351–377. Springer, Boston (1992). https://doi.org/10.1007/978-1-4615-3422-8_30

    Chapter  Google Scholar 

  13. Borchert, B., Lozano, A.: Succinct circuit representations and leaf languages are basically the same concept. Technical report, Universitat Politechnica de Catalunya (1996). http://upcommons.upc.edu/handle/2117/97245

  14. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computing, University of Latvia, Raiņa Bulv. 19, Riga, Latvia

    Māris Valdats

Authors
  1. Māris Valdats
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Māris Valdats .

Editor information

Editors and Affiliations

  1. Bar-Ilan University, Ramat Gan, Israel

    Shmuel Tomi Klein

  2. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  3. Ariel University, Ariel, Israel

    Dana Shapira

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Valdats, M. (2018). Descriptional and Computational Complexity of the Circuit Representation of Finite Automata. In: Klein, S., Martín-Vide, C., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science(), vol 10792. Springer, Cham. https://doi.org/10.1007/978-3-319-77313-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77313-1_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77312-4

  • Online ISBN: 978-3-319-77313-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation