Pages that link to "Item:Q948083"
From MaRDI portal
The following pages link to Fast reversible language recognition using cellular automata (Q948083):
Displaying 21 items.
- Reversible top-down syntax analysis (Q832945) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- Fast one-way cellular automata with reversible Mealy cells (Q1704109) (← links)
- Reversible pushdown automata (Q1757838) (← links)
- Cellular automata with sparse communication (Q1959660) (← links)
- One-way reversible multi-head finite automata (Q2358688) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Reversible Limited Automata (Q2945882) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- One-Way Reversible Multi-head Finite Automata (Q3453731) (← links)
- Cellular Automata with Sparse Communication (Q3637339) (← links)
- (Q4294242) (← links)
- (Q4837658) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Real-Time Reversible One-Way Cellular Automata (Q5501613) (← links)
- Language Recognition by Reversible Partitioned Cellular Automata (Q5501617) (← links)
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)
- Reversible Top-Down Syntax Analysis (Q6169965) (← links)