Tree-Walking Pebble Automata-Reference-Cited by-同舟云学术

Tree-Walking Pebble Automata

Published:1999 Issue: Volume: Page:72-83
ISSN:
Container-title:Jewels are Forever
language:
Short-container-title:

Author:

Engelfriet Joost,Hoogeboom Hendrik Jan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-60207-8_7.pdf

Reference20 articles.

1. A.V. Aho and J.D. Ullman; Translations on a context free grammar, Inform, and Control 19 (1971), 439–475.

2. R. Bloem, J. Engelfriet; Monadic second order logic and node relations on graphs and trees, in J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, Lecture Notes in Computer Science 1261 , Springer-Verlag, 1997, pp. 144–161.

3. R. Bloem, J. Engelfriet; Characterization of properties and relations defined in monadic second order logic on the nodes of trees, Tech. Report 97–03, Leiden University, August 1997.

4. M. Blum, C. Hewitt; Automata on a 2-dimensional tape, in Proc. 8th IEEE Symp. on Switching and Automata Theory, pp. 155–160, 1967.

5. M. Blum, D. Kozen; On the power of the compass (or, why mazes are easier to search than graphs), Proc. 19th FOCS (Annual Symposium on Foundations of Computer Science), 1978, pp. 132–142.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Time to Cast Away Stones;Implementation and Application of Automata;2023

2. Walking Automata in Free Inverse Monoids;Lecture Notes in Computer Science;2016

3. Two-way pebble transducers for partial functions and their composition;Acta Informatica;2015-03-04

4. Walking on Data Words;Theory of Computing Systems;2015-01-14

5. Logical characterization of weighted pebble walking automata;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14