scientific article

zbMath0704.68072MaRDI QIDQ3484362

Didier Caucal

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityequivalence of simple grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Related Items

A fast algorithm to decide on the equivalence of stateless DPDA, Arithmetics properties of substitutions and infinite automata, Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines, Prime normal form and equivalence of simple grammars, Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)