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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.A. Baeza-Yates. 1991. Searching Subsequences. Theoretical Computer Science, 78, 363–376.
G.E. Barton, R.C. Berwick, and E.S. Ristad. 1987. Computational Complexity and Natural Language. MIT Press, Cambridge, MA.
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.
R.G. Downey and M.R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, Berlin.
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.
J.E. Hopcroft and J.D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
R.M. Kaplan and M. Kay. 1994. Regular Models of Phonological Rule Systems. Computational Linguistics, 20(3), 331–378.
L. Karttunen. 1998. The Proper Treatment of Optimality in Computational Phonology. Technical Report ROA-258-0498, Rutgers Optimality Archive.
D. Kozen. 1977. Lower Bounds for Natural Proof Systems. In 18th IEEE Symposium on Foundations of Computer Science, pp. 254–266. IEEE Press.
R.P. Kurshan. 1994. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press.
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.
H. Straubing. 1994. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, MA.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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