The parameterized complexity of intersection and composition operations on sets of finite-state automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2088, Issue , 2001, Pages 302-310

  Todd Wareham, H ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; TRANSDUCERS;

COMPOSITION PROBLEM; FINITE STATE; FINITE STATE TRANSDUCERS; NP-HARDNESS; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME;

AUTOMATA THEORY;

EID: 84954419190     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44674-5_26     Document Type: Conference Paper

References (13)

1. R.A. Baeza-Yates. 1991. Searching Subsequences. Theoretical Computer Science, 78, 363-376.
2. G.E. Barton, R.C. Berwick, and E.S. Ristad. 1987. Computational Complexity and Natural Language. MIT Press, Cambridge, MA.
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.
4. R.G. Downey and M.R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, Berlin.
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.
6. J.E. Hopcroft and J.D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
7. R.M. Kaplan and M. Kay. 1994. Regular Models of Phonological Rule Systems. Computational Linguistics, 20(3), 331-378.
8. L. Karttunen. 1998. The Proper Treatment of Optimality in Computational Phonology. Technical Report ROA-258-0498, Rutgers Optimality Archive.
9. D. Kozen. 1977. Lower Bounds for Natural Proof Systems. In 18th IEEE Symposium on Foundations of Computer Science, pp. 254-266. IEEE Press.
10. R.P. Kurshan. 1994. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press.
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.
12. H. Straubing. 1994. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, MA.
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.