论文信息 - A Fast Algorithm to Decide on Simple Grammars Equivalence

A Fast Algorithm to Decide on Simple Grammars Equivalence

We present an algorithm to decide on simple grammars equivalence. Its complexity in time and space is polynomial in the valuation and the length of the description of the compared grammars, and exponential if we only take the last parameter into account. From this algorithm, we deduce an optimal upper bound of the number of parallel derivations to be applied to decide on equivalence.

Didier Caucal

[1] Derick Wood,et al. Some remarks on the KH algorithm fors-grammars , 1973 .

[2] Leslie G. Valiant. The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[3] Amir Pnueli,et al. A Direct Algorithm for Checking Equivalence of LL(k) Grammars , 1977, Theor. Comput. Sci..

[4] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[5] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..

[6] Etsuji Tomita. An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata , 1984, Theor. Comput. Sci..

[7] Amiram Yehudai,et al. On Equivalence of Grammars Through Transformation Trees , 1979, Theor. Comput. Sci..

[8] Michio Oyamaguchi,et al. The Decidability of Equivalence for Determistic Stateless Pushdown Automata , 1978, Inf. Control..

[9] Didier Caucal. How to improve branching algorithms for deciding on grammars equivalence , 1987 .

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

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

[12] Leslie G. Valiant,et al. Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..