One-stack automata as acceptors of context-free languages

Authors:
Pradip Peter Dey;Mohammad Amin;Bhaskar Raj Sinha;Alireza Farahani
Affiliations:
National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA;National University, San Diego, CA
Venue:
Journal of Computing Sciences in Colleges
Year:
2010

Citing 5
Cited 0

Stack cooperation in multistack pushdown automata

Journal of Computer and System Sciences
Introduction to Computer Theory

Introduction to Computer Theory
Elements of the Theory of Computation

Elements of the Theory of Computation
Introduction to Automata Theory, Languages, and Computation

Introduction to Automata Theory, Languages, and Computation
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in learning general properties of context-free language modeling. One-stack automata are helpful to students for several reasons including: (1) their contrast with two-stack Pushdown Automata and multi-stack automata is revealing for computability; (2) their computer animation is helpful for learning their salient features; (3) their graphical representation is more easily obtained by augmenting Non-Deterministic Finite Automata for regular languages which usually precede context-free language acceptors in the logical sequence of ideas.