Skip to main content
SpringerLink
Log in

The Complexity of Intersecting Finite Automata Having Few Final States

  • Conference paper
Computer Science – Theory and Applications (CSR 2012)

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

Included in the following conference series:

Abstract

The problem of determining whether several finite automata accept a common word is closely related to the well-studied membership problem in transformation monoids. We review the complexity of the intersection problem and raise the issue of limiting the number of final states in the automata involved. In particular, we consider commutative automata with at most two final states and we partially elucidate the complexity of their intersection nonemptiness and related problems.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99–126 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arvind, V., Vijayaraghavan, T.C.: Classifying problems on linear congruences and abelian permutation groups using logspace counting classes. Comput. Complex. 19, 57–98 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bala, S.: Intersection of Regular Languages and Star Hierarchy. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 159–169. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Buntrock, G., Damm, C., Hertrampf, U., Meinel, C.: Structure and importance of logspace-mod class. Theory of Computing Systems 25, 223–237 (1992)

    MathSciNet  MATH  Google Scholar 

  5. Beaudry, M.: Membership testing in commutative transformation semigroups. Information and Computation 79(1), 84–93 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Beaudry, M.: Membership testing in transformation monoids. PhD thesis, McGill University (1988)

    Google Scholar 

  7. Babai, L., Luks, E.M., Seress, A.: Permutation groups in NC. In: Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 409–420 (1987)

    Google Scholar 

  8. Beaudry, M., McKenzie, P., Thérien, D.: The membership problem in aperiodic transformation monoids. J. ACM 39(3), 599–616 (1992)

    Article  MATH  Google Scholar 

  9. Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: FOCS, pp. 36–41 (1980)

    Google Scholar 

  10. Galil, Z.: Hierarchies of complete problems. Acta Informatica 6, 77–88 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company (1979)

    Google Scholar 

  12. Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata – a survey. Inf. Comput. 209(3), 456–470 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hertrampf, U., Reith, S., Vollmer, H.: A note on closure properties of logspace mod classes. Inf. Process. Lett. 75, 91–93 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Jones, N.D., Lien, Y.E., Laaser, W.T.: New problems complete for nondeterministic log space. Theory of Computing Systems 10, 1–17 (1976)

    MathSciNet  MATH  Google Scholar 

  15. Karakostas, G., Lipton, R.J., Viglas, A.: On the complexity of intersecting finite state automata and NL versus NP. Theoretical Computer Science 302(1-3), 257–274 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Knuth, D.E.: The art of computer programming: seminumerical algorithms, 2nd edn., vol. 2. Addison-Wesley (1981)

    Google Scholar 

  17. Kozen, D.: Lower bounds for natural proof systems. In: Proc. 18th Annual Symposium on Foundations of Computer Science, pp. 254–266 (1977)

    Google Scholar 

  18. Luks, E.M., McKenzie, P.: Parallel algorithms for solvable permutation groups. J. Comput. Syst. Sci. 37(1), 39–62 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lange, K.-J., Rossmanith, P.: The Emptiness Problem for Intersections of Regular Languages. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 346–354. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  20. Luks, E.M.: Parallel algorithms for permutation groups and graph isomorphism. In: FOCS, pp. 292–302. IEEE Computer Society (1986)

    Google Scholar 

  21. Luks, E.M.: Lectures on polynomial-time computation in groups. Technical report. College of Computer Science, Northeastern University (1990)

    Google Scholar 

  22. McKenzie, P., Cook, S.A.: The parallel complexity of abelian permutation group problems. SIAM J. Comput. 16, 880–909 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica 7, 101–104 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  24. Reingold, O.: Undirected st-connectivity in log-space. In: Proc. 37th Annual ACM Symposium on Theory of Computing, pp. 376–385 (2005)

    Google Scholar 

  25. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  26. Wareham, H.T.: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 302–310. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de recherche opérationnelle, Université de Montréal, Montréal, QC, Canada, H3T 1J4

    Michael Blondin & Pierre McKenzie

Authors
  1. Michael Blondin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre McKenzie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 191023, St. Petersburg, Russia

    Edward A. Hirsch

  2. University of Turku, 20014, Turku, Finland

    Juhani Karhumäki  & Arto Lepistö  & 

  3. Lobachevky State University of Nizhni Novgorod, 603950, Niszhi Novgorod, Russia

    Michail Prilutskii

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blondin, M., McKenzie, P. (2012). The Complexity of Intersecting Finite Automata Having Few Final States. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30642-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation