Pages that link to "Item:Q1130159"
From MaRDI portal
The following pages link to On time computability of functions in one-way cellular automata (Q1130159):
Displaying 13 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Simulation of one-way cellular automata by Boolean circuits (Q1041245) (← links)
- Fast one-way cellular automata. (Q1401242) (← links)
- Cellular automata with sparse communication (Q1959660) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (Q2800414) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- Complexity of One-Way Cellular Automata (Q5501608) (← links)
- Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- Shrinking one-way cellular automata (Q6191203) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
