Skip to main content
SpringerLink
Log in

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2000)

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

Included in the following conference series:

Abstract

This paper uses parameterized complexity analysis to delimit possible non-polynomial time algorithmic behaviors for the finite-state acceptor intersection and finite-state transducer intersection and composition problems. One important result derived as part of these analyses is the first proof of the NP-hardness of the finite-state transducer composition problem for both general and p-subsequential transducers.

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. R.A. Baeza-Yates. 1991. Searching Subsequences. Theoretical Computer Science, 78, 363–376.

    Article  MATH  MathSciNet  Google Scholar 

  2. G.E. Barton, R.C. Berwick, and E.S. Ristad. 1987. Computational Complexity and Natural Language. MIT Press, Cambridge, MA.

    Google Scholar 

  3. H.L. Bodlaender, R.G. Downey, M.R. Fellows, and H.T. Wareham. 1995. The Parameterized Complexity of Sequence Alignment and Consensus. Theoretical Computer Science, 147(1-2), 31–54.

    Article  MATH  MathSciNet  Google Scholar 

  4. R.G. Downey and M.R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, Berlin.

    Google Scholar 

  5. M.R. Garey and D.S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco.

    MATH  Google Scholar 

  6. J.E. Hopcroft and J.D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.

    MATH  Google Scholar 

  7. R.M. Kaplan and M. Kay. 1994. Regular Models of Phonological Rule Systems. Computational Linguistics, 20(3), 331–378.

    Google Scholar 

  8. L. Karttunen. 1998. The Proper Treatment of Optimality in Computational Phonology. Technical Report ROA-258-0498, Rutgers Optimality Archive.

    Google Scholar 

  9. D. Kozen. 1977. Lower Bounds for Natural Proof Systems. In 18th IEEE Symposium on Foundations of Computer Science, pp. 254–266. IEEE Press.

    Google Scholar 

  10. R.P. Kurshan. 1994. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press.

    Google Scholar 

  11. M. Mohri. 1997. On the Use of Sequential Transducers in Natural Language Processing. In E. Roche and Y. Schabes, eds., Finite-State Language Processing, pp. 355–382. MIT Press, Cambridge, MA.

    Google Scholar 

  12. H. Straubing. 1994. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, MA.

    MATH  Google Scholar 

  13. H.T. Wareham. 1999. Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D. thesis, Department of Computer Science, University of Victoria. Technical Report ROA-318-0599, Rutgers Optimality Archive.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Memorial University of Newfoundland, St. John’s, NF, Canada, A1B 3X5

    H. Todd Wareham

Authors
  1. H. Todd Wareham
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Todd Wareham, H. (2001). The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation