Minimal equational representations of recognizable tree languages

DOI10.1007/S002360050071MaRDI QIDQ1901719zbMATH OpenOpenAlexFDO

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

Recommendations

• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• Tree algebras and varieties of tree languages
• Publication:3468622
• scientific article; zbMATH DE number 139615
• Représentations matricielles des séries d'arbre reconnaissables

Cited in

(12)

• Restricted ground tree transducers
• Congruential complements of ground term rewrite systems
• Deterministic bottom-up tree transducers and ground term rewrite systems
• Intersection of finitely generated congruences over term algebra
• Term rewriting restricted to ground terms.
• A fast algorithm for constructing a tree automaton recognizing a congruential tree language
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• scientific article; zbMATH DE number 1136085 (Why is no real title available?)
• On ground tree transformations and congruences induced by tree automata.
• Constructing small tree grammars and small circuits for formulas
• scientific article; zbMATH DE number 4135419 (Why is no real title available?)
• scientific article; zbMATH DE number 139615 (Why is no real title available?)

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

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