Definability by Horn formulas and linear time on cellular automata
From MaRDI portal
Publication:5111431
DOI10.4230/LIPIcs.ICALP.2017.99zbMath1442.68118OpenAlexW2601070892MaRDI QIDQ5111431
Frédéric Olive, Nicolas Bacquey, Etienne Grandjean
Publication date: 27 May 2020
Full work available at URL: https://hal.science/hal-01494246
second-order logiclogic programminglinear timepicture languagesdescriptive complexityHorn formulaslocal inductioncellular automata of any dimension
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Decidability of theories and sets of sentences (03B25)
Related Items (1)
This page was built for publication: Definability by Horn formulas and linear time on cellular automata