Skip to main content
Conference ProceedingsOPEN ACCESS

Recognition of linear-slender context-free languages by real time one-way cellular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9099 251-262
DOI: 10.1007/978-3-662-47221-7_19
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.

Cite

CITATION STYLE

APA

Terrier, V. (2015). Recognition of linear-slender context-free languages by real time one-way cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9099, pp. 251–262). Springer Verlag. https://doi.org/10.1007/978-3-662-47221-7_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free