scientific article; zbMATH DE number 4157904

zbMATH Open0705.68080MaRDI QIDQ3485880FDOQ3485880

Authors: Sándor Vágvölgyi, Zoltán Fülöp 

Publication date: 1990

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

Recommendations

• Tree automata for rewrite strategies
• Linearizing term rewriting systems using test sets
• Publication:3490949
• On tree automata that certify termination of left-linear term rewriting systems
• Computing linearizations using test sets

zbMATH Keywords

tree automatatree languageterm rewriting systemset of irreducible trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Cited In (8)

• Title not available (Why is that?)
• Top-down tree transducers with two-way tree walking look-ahead
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Decidability of equivalence for deterministic synchronized tree automata
• Regular sets of descendants by leftmost strategy
• CHAP and rewrite components
• Term rewriting restricted to ground terms.
• Decidability of equivalence for deterministic synchronized tree automata

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 Q3485880)