scientific article; zbMATH DE number 4157904

MaRDI QIDQ3485880zbMATH OpenFDO

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

Publication date 1990

zbMATH Keywords

set of irreducible treesterm rewriting systemtree automatatree language

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Top-down tree transducers with two-way tree walking look-ahead
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Linearizing term rewriting systems using test sets
• Term rewriting restricted to ground terms.
• Regular sets of descendants by leftmost strategy
• scientific article; zbMATH DE number 4164137 (Why is no real title available?)
• Decidability of equivalence for deterministic synchronized tree automata
• Decidability of equivalence for deterministic synchronized tree automata
• CHAP and rewrite components

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)