Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396)
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: Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. |
scientific article; zbMATH DE number 1965395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. |
scientific article; zbMATH DE number 1965395 |
Statements
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (English)
0 references
17 August 2003
0 references
Uniquely parsable grammar
0 references
Cellular automata
0 references
Parallel parsing
0 references
0.8234260678291321
0 references
0.7505685091018677
0 references
0.7430765628814697
0 references
0.7410560846328735
0 references
