Finite automata and non-self-embedding grammars

Authors:
Marcella Anselmo;Dora Giammarresi;Stefano Varricchio
Affiliations:
Dipartimento di Informatica ed Applicazioni, Università di Salerno, Baronissi, Italy;Dipartimento di Matematica. Università di Roma "Tor Vergata", Roma, Italy;Dipartimento di Matematica. Università di Roma "Tor Vergata", Roma, Italy
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 2
Cited 1

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory

Picture languages: tiling systems versus tile rewriting grammars

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider non-self-embedding (NSE) context-free grammars as a representation of regular sets.We point out its advantages with respect to more classical representations by finite automata, in particular when considering the efficient realization of the rational operations. We give a characterization in terms of composition of regular grammars and state relationships between NSE grammars and push-down automata. Finally we show a polynomial algorithm to decide whether a context-free grammars is self-embedding or not.