Some computational limits of trellis automata

DOI10.1007/978-3-319-58631-1_14zbMath1451.68188OpenAlexW2611180533MaRDI QIDQ1704113

Véronique Terrier

Publication date: 8 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-58631-1_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (3)

Inductive definitions in logic versus programs of real-time cellular automata ⋮ \(\mathrm{GF}(2)\)-operations on basic families of formal languages ⋮ On hardest languages for one-dimensional cellular automata

This page was built for publication: Some computational limits of trellis automata