Logics for context-free languages
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 205-216
- https://doi.org/10.1007/bfb0022257
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On monadic NP vs. monadic co-NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph connectivity and monadic NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph Connectivity, Monadic NP and built-in relations of moderate degreePublished by Springer Nature ,1995
- Regular languages in NC1Journal of Computer and System Sciences, 1992
- Reachability is harder for directed than for undirected finite graphsThe Journal of Symbolic Logic, 1990
- Second-order and Inductive Definability on Finite StructuresMathematical Logic Quarterly, 1987
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Algebraic automata and context-free setsInformation and Control, 1967
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960