The expressive power of transitive closure and 2-way multihead automata-Reference-Cited by-同舟云学术

The expressive power of transitive closure and 2-way multihead automata

Published: Issue: Volume: Page:1-14
ISSN:
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Bargury Yaniv,Makowsky Johann

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0023754.pdf

Reference16 articles.

1. Yaniv Bargury. The Hierarchy of Transitive Closure Master thesis, Department of Computer Science, Technion—Israel Institute of Technology, Haifa, (In preparation).

2. J. R. Büchi. Weak second-order arithmetic and finite automata Z. Math. Logik Grundlagen Math 6, 66–92, 1960.

3. Ariel Calò. The Expressive Power of Transitive Closure Master thesis, Department of Computer Science, Technion—Israel Institute of Technology, Haifa, 1990.

4. Ariel Calò and J.A. Makowsky, The expressive power of transitive closure, to appear in the proceedings of the Symposium on Logical Foundations of Computer Science ‘Logic at Tver '92', Lecture Notes in Computer Science, 1992.

5. W. Coy, Automata in Labyrinths Fundamentals of Computation Theory, LNCS 56, 65–71, 1977.

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

1. Characterizing weighted MSO for trees by branching transitive closure logics;Theoretical Computer Science;2015-08

2. Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure;Logical Methods in Computer Science;2007-04-26

3. Monadic Second-Order Logic and Transitive Closure Logics over Trees;Electronic Notes in Theoretical Computer Science;2006-11

4. Nested Pebbles and Transitive Closure;STACS 2006;2006

5. On the power of tree-walking automata;Information and Computation;2003-05