论文信息 - The equivalence problem for real-time strict deterministic pushdown automata - 字舞流文

The equivalence problem for real-time strict deterministic pushdown automata

A comparison method is described for a pair of real-time strict deterministic pushdown automata, capable of deciding their equivalence.

[1] John E. Hopcroft,et al. Simple Deterministic Languages , 1966, SWAT.

[2] Peter Hilton,et al. Introduction to the Theory of Categories and Functors , 1968 .

[3] V. Meitus. Transforming categories and finite transformers. I , 1978 .

[4] George Gratzer,et al. Universal Algebra , 1979 .

[5] V. Yu. Romanovskii. Equivalence problem for real-time strict deterministic pushdown automata , 1980 .

[6] Michio Oyamaguchi,et al. The Equivalence Problem for Real-Time Strict Deterministic Languages , 1980, Inf. Control..

[7] V. Y. Romanovskii. The equivalence problem for real-time deterministic pushdown automata , 1986 .