Complementing deterministic tree-walking automata-Reference-Cited by-同舟云学术

Complementing deterministic tree-walking automata

Published:2006-07 Issue:1 Volume:99 Page:33-39
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Muscholl Anca,Samuelides Mathias,Segoufin Luc

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Translations on a context-free grammar;Aho;Information and Control,1971

2. M. Bojanczyk, T. Colcombet, Tree walking automata cannot be determinized, in: Proc. of Internat. Coll. on Automata, Languages and Programming, 2004

3. M. Bojanczyk, T. Colcombet, Tree-walking automata do not recognize all regular languages, in: Proc. ACM SIGACT Symp. on Theory of Computing, 2005

4. J. Engelfriet, H.J. Hoogeboom, Automata with nested pebbles capture first-order logic with transitive closure, Technical Report 05-02, Leiden Institute of Advanced Computer Science, Leiden University, April 2005

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

1. State Complexity of Boolean Operations on Graph-Walking Automata;International Journal of Foundations of Computer Science;2024-07-12

2. Homomorphisms and inverse homomorphisms on graph-walking automata;Theoretical Computer Science;2023-11

3. State complexity of transforming graph-walking automata to halting, returning and reversible;Information and Computation;2023-03

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

5. State Complexity of Union and Intersection on Graph-Walking Automata;Descriptional Complexity of Formal Systems;2021