Nested Pebbles and Transitive Closure
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 477-488
- https://doi.org/10.1007/11672142_39
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The expressive power of transitive closure and 2-way multihead automataPublished by Springer Science and Business Media LLC ,2005
- Tree-Walking Automata Cannot Be DeterminizedLecture Notes in Computer Science, 2004
- Caterpillars: a context specification techniqueMarkup Languages: Theory and Practice, 2000
- Tree-Walking Pebble AutomataPublished by Springer Science and Business Media LLC ,1999
- Space Lower Bounds for Maze Threadability on Restricted MachinesSIAM Journal on Computing, 1980
- On the power of the compass (or, why mazes are easier to search than graphs)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Automata and LabyrinthsMathematische Nachrichten, 1978
- Translations on a context free grammarInformation and Control, 1971
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Automata on a 2-dimensional tapePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967