An automata-theoretic characterization of the chomsky-hierarchy

Authors:
Benedek Nagy
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary
Venue:
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Year:
2010

Citing 5
Cited 0

Context-sensitive string languages and recognizable picture languages

Information and Computation
Handbook of Formal Languages

Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation

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

Acta Informatica
More Concise Representation of Regular Languages by Automata and Regular Expressions

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper a new family of stateless (non-deterministic) pushdown automata are used to accept languages of the Chomsky hierarchy Having only a stack with at most 1 symbol the regular languages can be recognized The usual pushdown automata accept the context-free languages The extended version which uses additional half-translucent shadow symbols accept the context-sensitive languages Finally, allowing a kind of λ-transitions the automata accept any recursively enumerable languages.