Theoretical Computer Science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Systematic parameterized complexity analysis in computational phonology
Systematic parameterized complexity analysis in computational phonology
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A parametric analysis of the state-explosion problem in model checking
Journal of Computer and System Sciences
The parameterized complexity of chosen problems for finite automata on trees
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
| Hi-index | 0.00 |
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.