论文信息 - Generalized Counters and Reversal Complexity - 字舞流文

Generalized Counters and Reversal Complexity

We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.

M. V. Panduranga Rao

[1] Tao Jiang,et al. On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages , 1993, Int. J. Found. Comput. Sci..

[2] Zvi Galil,et al. Fooling a two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines , 1982, Theor. Comput. Sci..

[3] Victor Mitrana,et al. Extended finite automata over groups , 2001, Discret. Appl. Math..

[4] Holger Petersen. Two-way one-counter automata accepting bounded languages , 1994, SIGA.

[5] Eitan M. Gurari,et al. Two-Way Counter Machines and Diophantine Equations , 1982, JACM.

[6] Victor Mitrana,et al. Finite Automata over Free Groups , 2000, Int. J. Algebra Comput..

[7] Burkhard Monien. Deterministic Two-Way One-Head Pushdown Automata are Very Powerful , 1984, Inf. Process. Lett..

[8] Andris Ambainis,et al. Two-way finite automata with quantum and classical state , 1999, Theor. Comput. Sci..

[9] Satoru Miyano,et al. Remarks on Two-Way Automata with Weak-Counters , 1984, Inf. Process. Lett..

[10] Sheila A. Greibach. Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[11] Oscar H. Ibarra,et al. Finite Automata with Multiplication , 1976, Theor. Comput. Sci..

[12] Satoru Miyano. Two-Way Deterministic Multi-Weak-Counter Machines , 1982, Theor. Comput. Sci..

[13] Victor Mitrana,et al. The Accepting Power of Finite Automata over Groups , 1997, New Trends in Formal Languages.