LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata

The paper introduces a subfamily of synchronized alternating pushdown automata, deterministic synchronized alternating pushdown automata, and a subfamily of conjunctive grammars, LR(0)conjunctive grammars. It is shown that deterministic synchronized alternating pushdown automata and LR(0) conjunctiv...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer and system sciences 2016-12, Vol.82 (8), p.1329-1359
Main Authors: Aizikowitz, Tamar, Kaminski, Michael
Format: Article
Language:English
Subjects:
[formula omitted] conjunctive grammars
Conjunctive grammars
Deterministic synchronized alternating pushdown automata
Synchronized alternating pushdown automata
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper introduces a subfamily of synchronized alternating pushdown automata, deterministic synchronized alternating pushdown automata, and a subfamily of conjunctive grammars, LR(0)conjunctive grammars. It is shown that deterministic synchronized alternating pushdown automata and LR(0) conjunctive grammars have the same recognition/generation power, analogously to the classical equivalence between acceptance by empty stack of deterministic pushdown automata and LR(0) grammars. These models form the theoretical basis for efficient linear time parsing of a subfamily of conjunctive languages which properly includes the classical LR(0) languages.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2016.05.008