Left-most derivation and shadow-pushdown automata for context-sensitive languages

Authors:
Benedek Nagy
Affiliations:
Department of Computer Science, University of Debrecen, Debrecen, Hungary and Research Group on Mathematical Linguistics, Rovira I Virgili University, Tarragona, Spain
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 4
Cited 0

Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Context-sensitive string languages and recognizable picture languages

Information and Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Families of automata characterizing context-sensitive languages

Acta Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper left-most derivation for context-sensitive grammars is presented based on Penttonen one-sided normal-form. The derivations using grammars in normal form are represented by tree-like graphs. Left-most derivation is defined in the sense of constructing the derivation graph. The concept of the well-known pushdown automata is generalised. A special-type of automata, the so-called shadow-pushdown automata are presented. The work of the automata is based on the left-most derivation of context-sensitive languages. The class of shadow-pushdown automata characterizes exactly the context-sensitive languages.