Model checking one-dimensional cellular automata

MaRDI QIDQ3636525zbMATH OpenFDO

Authors K. Sutner

Publication date 30 June 2009

zbMATH Keywords

cellular automatadecidabilityfirst-order logicfirst-order spectramodel checking

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Cellular automata (computational aspects) (68Q80)

Recommendations

• On decidability properties of one-dimensional cellular automata
• Linear cellular automata and decidability
• Cellular automata, decidability and phasespace
• scientific article; zbMATH DE number 1985715
• More decision algorithms for global properties of 1D cellular automata

Cited in

(5)

• On the complexity of asynchronous freezing cellular automata
• On decidability properties of one-dimensional cellular automata
• Cellular automata, decidability and phasespace
• Nonlinear endogenous business cycles: Zambelli-Goodwin excursions in cellular automata worlds
• Computational processes, observers and Turing incompleteness

This page was built for publication: Model checking one-dimensional cellular automata

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