scientific article; zbMATH DE number 3550189
From MaRDI portal
Publication:4124336
Cited in
(6)- Indirect addressing and the time relationships of some models of sequential computation
- Ramified Corecurrence and Logspace
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- Explicit time and space efficient encoders exist only with random access
- On properties of languages accepted by deterministic pushdown automata with translucent input letters
- On the power of real-time two-way multihead finite automata with jumps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124336)
