Language recognition by two-way deterministic pushdown automata |
| |
| Authors: | L P Lisovik D A Koval’ |
| |
| Affiliation: | (1) T. G. Shevchenko National University, Kiev, Ukraine |
| |
| Abstract: | It is proved that any bounded context-free language can be recognized by a two-way deterministic automaton with a finite-rotary counter.Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 177–181, November–December 2004.This revised version was published online in April 2005 with a corrected cover date. |
| |
| Keywords: | semilinear set automaton with a finite-rotary counter context-free language |
| 本文献已被 SpringerLink 等数据库收录！ |
