scientific article; zbMATH DE number 1995182

zbMath1023.68601MaRDI QIDQ4431392

Rémi Gilleron, Sándor Vágvölgyi

Publication date: 21 October 2003

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

Computing linearizations using test sets ⋮ Undecidable properties of deterministic top-down tree transducers ⋮ More problems in rewriting ⋮ Towards an efficient construction of test sets for deciding ground reducibility ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ Excessively duplicating patterns represent non-regular languages ⋮ The HOM Problem is EXPTIME-Complete ⋮ Recognizable tree-languages and nonlinear morphisms