A grammatical characterization of alternating pushdown automata
Theoretical Computer Science
Deciding properties of nonregular programs
SIAM Journal on Computing
The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Reasoning about knowledge
Shape analysis as a generalized path problem
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
More on nonregular PDL: finite models and Fibonacci-like programs
Information and Computation
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Security verification of programs with stack inspection
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Strengthened Results on Nonregular PDL
Strengthened Results on Nonregular PDL
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Information and Computation
A Robust Class of Context-Sensitive Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We show interreducibility under (Turing) reductions of low polynomial degree between three families of problems parametrised by classes of formal languages: the problem of reachability in a directed graph constrained by a formal language, the problem of deciding whether or not the intersection of a language of some class with a regular language is empty, and the model checking problem for Propositional Dynamic Logic over some class of formal languages. This allows several decidability and complexity results to be transferred, mainly from the area of formal languages to the areas of modal logics and formal language constrained reachability.