论文信息 - Accepting runs in a two-way finite automaton

Accepting runs in a two-way finite automaton

Abstract An accepting run in a two-way finite automaton M is a sequence of states that M enters during some accepting computation. The set of all such runs is denoted by L run , M . We study the complexity of L run , M when M is a 2NFA (2DFA). We also look at the complexity of “position sampling” (the sequence of states that M enters in specified positions of some accepted input) in a 2NFA. In particular, we give some language properties of sampled runs of 2NFAs augmented with restricted unbounded storage.

Qin Li | Oscar H. Ibarra | Zhe Dang

[1] Oscar H. Ibarra,et al. Automata with Reversal-Bounded Counters: A Survey , 2014, DCFS.

[2] Oscar H. Ibarra,et al. Sampling a Two-Way Finite Automaton , 2015 .

[3] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[4] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..

[5] Oscar H. Ibarra,et al. Execution Information Rate for Some Classes of Automata , 2013, LATA.

[6] Qin Li,et al. Sampling automata and programs , 2015, Theor. Comput. Sci..

[7] Tero Harju,et al. Some Decision Problems Concerning Semilinearity and Commutation , 2002, J. Comput. Syst. Sci..

[8] Tao Jiang,et al. New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..

[9] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.

[10] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[11] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[12] Eitan M. Gurari,et al. The Complexity of Decision Problems for Finite-Turn Multicounter Machines , 1981, J. Comput. Syst. Sci..