论文信息 - Speed of Recognition of Context-Free Languages by Array Automata

Speed of Recognition of Context-Free Languages by Array Automata

The recognition speed of context-free languages (CFL’s) using arrays of finite state machines is considered. It is shown that CFL’s can be recognized by 2-dimensional arrays in linear time and by 1-dimensional arrays in time $n^2 $.

S. Rao Kosaraju

[1] Sambasiva Rao Kosaraju. Computations on iterative automata , 1969 .

[2] Leslie G. Valiant,et al. General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[3] Stephen N. Cole. Deterministic Pushdown Store Machines and Real-Time Computation , 1971, JACM.