Minimal equational representations of recognizable tree languages

DOI10.1007/s002360050071zbMath0865.68071OpenAlexW2160076160MaRDI QIDQ1901719

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

Publication date: 15 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050071

zbMATH Keywords

tree languagerecognizable tree languagesterm algebracongruential tree languagesdeterministic bottom-up tree automatonequational representations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Intersection of finitely generated congruences over term algebra ⋮ Term rewriting restricted to ground terms. ⋮ On ground tree transformations and congruences induced by tree automata. ⋮ Deterministic bottom-up tree transducers and ground term rewrite systems ⋮ Congruential complements of ground term rewrite systems ⋮ Restricted ground tree transducers

This page was built for publication: Minimal equational representations of recognizable tree languages