Definability by Horn formulas and linear time on cellular automata (Q5111431)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Definability by Horn formulas and linear time on cellular automata |
scientific article; zbMATH DE number 7204551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definability by Horn formulas and linear time on cellular automata |
scientific article; zbMATH DE number 7204551 |
Statements
27 May 2020
0 references
picture languages
0 references
linear time
0 references
cellular automata of any dimension
0 references
local induction
0 references
descriptive complexity
0 references
second-order logic
0 references
Horn formulas
0 references
logic programming
0 references
Definability by Horn formulas and linear time on cellular automata (English)
0 references
0.803949773311615
0 references
0.7737482786178589
0 references
0.7388312220573425
0 references
0.7332007884979248
0 references
