scientific article; zbMATH DE number 1995182

zbMATH Open1023.68601MaRDI QIDQ4431392FDOQ4431392

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

Publication date: 21 October 2003

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (8)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4431392)