Second-Order Simple Grammars
Higher-order notations for trees have a venerable history from the 1970s and 1980s when schemes (that is, functional programs without interpretations) and their relationship to formal language theory were first studied. Included are higher-order recursion schemes and pushdown automata. Automata and language theory study finitely presented mechanisms for generating languages. Instead of language generators, one can view them as process calculi, propagators of possibly infinite labelled transition systems. Recently, model-checking techniques have been successfully extended to these higher-order notations in the deterministic case [18,9,8,21].
KeywordsDecision Procedure Basic Transition Label Transition System Short Word Proof Tree
Unable to display preview. Download preview PDF.
- 1.Aehlig, K., De Miranda, J., Ong, C.-H.L.: Safety is not a restriction at level 2 for string languages. LNCS, vol. 3411, pp. 490–511 (2005)Google Scholar
- 5.Blumensath, A.: A pumping lemma for higher-order pushdown automata (preprint 2004)Google Scholar
- 8.Cachat, T.: Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. LNCS, vol. 2719, pp. 556–569 (2003)Google Scholar
- 10.Courcelle, B.: A representation of trees by languages I and II. Theoretical Computer Science 6, 255–279 and 7, 25–55 (1978)Google Scholar
- 14.Fischer, M.: Grammars with macro-like productions. In: Procs. 9th Annual IEEE Symposium on Switching and Automata Theory, pp. 131–142 (1968)Google Scholar
- 19.Korenjak, A., Hopcroft, J.: Simple deterministic languages. In: Procs. 7th Annual IEEE Symposium on Switching and Automata Theory, pp. 36–46 (1966)Google Scholar
- 20.Maslov, A.: Multilevel stack automata. Problems of Information Transmission 12, 38–43 (1976)Google Scholar
- 21.Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes (preprint 2006)Google Scholar
- 25.Sénizergues, G.:The equivalence problem for t-turn DPDA is co-NP. LNCS, vol. 2719, pp. 478–489 (2003)Google Scholar