Linear conjunctive grammars and one-turn synchronized alternating pushdown automata

Authors:
Tamar Aizikowitz;Michael Kaminski
Affiliations:
Department of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel
Venue:
FG'09 Proceedings of the 14th international conference on Formal grammar
Year:
2009

Citing 9
Cited 0

The equivalence of four extensions of context-free grammars

Mathematical Systems Theory
Alternation

Journal of the ACM (JACM)
Weak alternating automata are not that weak

ACM Transactions on Computational Logic (TOCL)
Conjunctive grammars

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)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the closure properties of linear conjunctive languages

Theoretical Computer Science
A recognition and parsing algorithm for arbitrary conjunctive grammars

Theoretical Computer Science
Finite turns and the regular closure of linear context-free languages

Discrete Applied Mathematics
Conjunctive Grammars and Alternating Pushdown Automata

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a sub-family of synchronized alternating pushdown automata, one-turn Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by Linear Conjunctive Grammars. This equivalence is analogous to the classical equivalence between one-turn PDA and Linear Grammars, thus strengthening the claim of Synchronized Alternating Pushdown Automata as a natural counterpart for Conjunctive Grammars.