Some computational limits of trellis automata

DOI10.1007/978-3-319-58631-1_14MaRDI QIDQ1704113zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Systolic trellis automata: Stability, decidability and complexity
• Characterizations and computational complexity of systolic trellis automata
• scientific article; zbMATH DE number 4047120
• A property of real-time trellis automata
• Systolic trellis automatat†

Cited in

(7)

• A property of real-time trellis automata
• scientific article; zbMATH DE number 1836421 (Why is no real title available?)
• scientific article; zbMATH DE number 7298596 (Why is no real title available?)
• Inductive definitions in logic versus programs of real-time cellular automata
• On hardest languages for one-dimensional cellular automata
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages
• Characterizations and computational complexity of systolic trellis automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704113)