, Variations of the firing squad problem and applications, Information Processing Letters, vol.30, issue.3, pp.152-157, 1989.
, Systolic trellis automata. II, International Journal Computer Mathematics, vol.16, pp.3-22, 1984.
, One-way bounded cellular automata, Information and Control, vol.44, issue.3, pp.261-281, 1980.
DOI : 10.1016/S0019-9958(80)90164-3
URL : http://doi.org/10.1016/s0019-9958(80)90164-3
, Linear functional classes over cellular automata, Proceedings AUTOMATA & JAC 2012, pp.177-193, 2012.
DOI : 10.4204/EPTCS.90.15
URL : https://hal.archives-ouvertes.fr/hal-01085911
, Automaton Representation of Linear Conjunctive Languages, International Conference on Developments in Language Theory, pp.393-404, 2002.
DOI : 10.1007/3-540-45005-X_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5313
, On the equivalence of linear conjunctive grammars and trellis automata, RAIRO Informatique Théorique et Applications, pp.69-88, 2004.
DOI : 10.1051/ita:2004004
, Conjunctive and Boolean grammars: The true general case of the context-free grammars, Computer Science Review, vol.9, pp.27-59, 2013.
DOI : 10.1016/j.cosrev.2013.06.001
, Input-driven languages are linear conjunctive, Theoretical Computer Science, vol.618, pp.52-71, 2016.
DOI : 10.1016/j.tcs.2016.01.007
, On real time one-way cellular array, Theoretical Computer Science, vol.141, issue.1-2, pp.331-335, 1995.
DOI : 10.1016/0304-3975(94)00212-2
URL : http://doi.org/10.1016/0304-3975(94)00212-2
, Language not recognizable in real time by one-way cellular automata, Theoretical Computer Science, vol.156, issue.1-2, pp.281-287, 1996.
DOI : 10.1016/0304-3975(95)00111-5
URL : http://doi.org/10.1016/0304-3975(95)00111-5
, Recognition of poly-slender context-free languages by trellis automata, Theoretical Computer Science, vol.692, 2017.
DOI : 10.1016/j.tcs.2017.05.041
URL : https://hal.archives-ouvertes.fr/hal-01578304