Tree acceptors and some of their applications-Reference-Cited by-同舟云学术

Tree acceptors and some of their applications

Published:1970-10 Issue:5 Volume:4 Page:406-451
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Doner John

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference28 articles.

1. Weak second-order arithmetic and finite automata;Buchi;Z. Math. Logik Grundlagen Math.,1960

2. On a decision method in restricted second-order arithmetic;Buchi,1962

3. J.R.Buchi, Transfinite automata recursions and weak second-order theory of ordinals ”Logic, Methology and Philosophy of Science“, Proc. 1964 Int. Congress, North-Holland Amsterdam.

4. Decision methods in the theory of ordinals;Buchi;Bull. Amer. Math. Soc.,1965

5. Decision problems of weak second-order arithmetic and finite automata, Abstract No. 553-112;Buchi;Notices Amer. Math. Soc.,1958

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

1. Top-down complementation of automata on finite trees;Information Processing Letters;2025-01

2. Rational weighted tree languages with storage;Information and Computation;2024-12

3. Succinct ordering and aggregation constraints in algebraic array theories;Journal of Logical and Algebraic Methods in Programming;2024-08

4. Orchard: Heterogeneous Parallelism and Fine-grained Fusion for Complex Tree Traversals;ACM Transactions on Architecture and Code Optimization;2024-05-21

5. The Weighted HOM-Problem Over Fields;Lecture Notes in Computer Science;2024