Recognition of linear-slender context-free languages by real time one-way cellular automata
Résumé
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salo-maa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton .
Origine : Fichiers produits par l'(les) auteur(s)
Loading...