论文信息 - An 11-state trellis automaton for a P-complete language - 字舞流文

An 11-state trellis automaton for a P-complete language

An 11-state trellis automaton recognizing a P-complete language over the alphabet {a, b} is constructed.

Alexander Okhotin

[1] Alvy Ray Smith,et al. Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

[2] Alexander Okhotin,et al. Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[3] Charles R. Dyer,et al. One-Way Bounded Cellular Automata , 1980, Inf. Control..

[4] Alexander Okhotin,et al. On the equivalence of linear conjunctive grammars and trellis automata , 2004, RAIRO Theor. Informatics Appl..

[5] H. James Hoover,et al. Limits to Parallel Computation: P-Completeness Theory , 1995 .

[6] Oscar H. Ibarra,et al. Characterizations and Computational Complexity of Systolic Trellis Automata , 1984, Theor. Comput. Sci..

[7] Alexander Okhotin. The hardest linear conjunctive language , 2003, Inf. Process. Lett..

[8] R. Ladner. The circuit value problem is log space complete for P , 1975, SIGA.

[9] Alexander Okhotin. A Simple P-Complete Problem and Its Representations by Language Equations , 2007, MCU.

[10] L. Goldschlager. The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[11] Arto Salomaa,et al. Systolic trellis automatat , 1984 .