Pebble machines and tree walking machines
From MaRDI portal
Publication:1170037
DOI10.1016/0020-0255(82)90054-8zbMath0496.68042OpenAlexW2089140637MaRDI QIDQ1170037
Publication date: 1982
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(82)90054-8
Cites Work
- Unnamed Item
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Space Lower Bounds for Maze Threadability on Restricted Machines
- Transformations and translations from the point of view of generalized finite automata theory
- Algebraic automata and context-free sets
- Mappings and grammars on trees
- Translations on a context free grammar
This page was built for publication: Pebble machines and tree walking machines