Conjunctive Grammars and Alternating Pushdown Automata

Authors:
Tamar Aizikowitz;Michael Kaminski
Affiliations:
Department of Computer Science Technion, Israel Institute of Technology,;Department of Computer Science Technion, Israel Institute of Technology,
Venue:
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Year:
2008

Citing 8
Cited 2

A grammatical characterization of alternating pushdown automata

Theoretical Computer Science
A characterization of exponential-time languages by alternating context-free grammars

Theoretical Computer Science
The equivalence of four extensions of context-free grammars

Mathematical Systems Theory
Alternation

Journal of the ACM (JACM)
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

Linear conjunctive grammars and one-turn synchronized alternating pushdown automata

FG'09 Proceedings of the 14th international conference on Formal grammar
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by conjunctive grammars.