%0 Conference Proceedings
%T Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
%+ Université de Caen Normandie (UNICAEN)
%A Terrier, Véronique
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 251-262
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_19
%Z Computer Science [cs]Conference papers
%X A linear-slender context-free language is a context-free language whose number of words of length <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>n</mi></math> is linear in <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>n</mi></math>. 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442477/document
%2 https://inria.hal.science/hal-01442477/file/338243_1_En_19_Chapter.pdf
%L hal-01442477
%U https://inria.hal.science/hal-01442477
%~ IFIP-LNCS
%~ IFIP
%~ COMUE-NORMANDIE
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ UNICAEN