论文信息 - State Complexity of Union and Intersection on Graph-Walking Automata - 字舞流文

State Complexity of Union and Intersection on Graph-Walking Automata

Alexander Okhotin | Olga Martynova

[1] Michael Sipser,et al. Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2] Andrzej Pelc,et al. Graph exploration by a finite automaton , 2005, Theor. Comput. Sci..

[3] Alexander Okhotin,et al. Reversibility of computations in graph-walking automata , 2020, Inf. Comput..

[4] Max Klimm,et al. Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents , 2018, J. ACM.

[5] Alexander Okhotin. Graph-Walking Automata: From Whence They Come, and Whither They are Bound , 2019, CIAA.

[6] Alexander Okhotin,et al. Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata , 2014, MFCS.

[7] Anca Muscholl,et al. Complementing deterministic tree-walking automata , 2006, Inf. Process. Lett..

[8] Kai Salomaa,et al. Operational state complexity of nested word automata , 2008, Theor. Comput. Sci..

[9] Thomas Colcombet,et al. Tree-Walking Automata Do Not Recognize All Regular Languages , 2008, SIAM J. Comput..

[10] L. Budach. Automata and Labyrinths , 1978 .

[11] Carlo Mereghetti,et al. Complementing two-way finite automata , 2007, Inf. Comput..

[12] Christos A. Kapoutsis,et al. Complement for two-way alternating automata , 2020, Acta Informatica.