Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Abstract : A linear-slender context-free language is a context-free language whose number of words of length is linear in . 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.
https://hal.inria.fr/hal-01442477 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, January 20, 2017 - 4:09:28 PM Last modification on : Tuesday, October 19, 2021 - 11:34:30 PM Long-term archiving on: : Friday, April 21, 2017 - 3:43:52 PM
Véronique Terrier. Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.251-262, ⟨10.1007/978-3-662-47221-7_19⟩. ⟨hal-01442477⟩