Classes of tree languages and DR tree languages given by classes of semigroups

DOI10.14232/ACTACYB.20.2.2011.3MaRDI QIDQ2915546zbMATH OpenOpenAlexFDO

Authors Ferenc Gécseg

Publication date 18 September 2012

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b09dd916f5e2cbcdc8a35bea63e8f4853a5851b5

zbMATH Keywords

DR recognizable tree languagesrecognizable tree languagessyntactic monoidssyntactic semigroups

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Classes of tree languages determined by classes of monoids
• scientific article; zbMATH DE number 2143012
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• On DR tree automata, unary algebras and syntactic path monoids
• On reverse and general definite tree languages (extended abstract)

Cited in

(9)

• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• Classes of tree languages determined by classes of monoids
• On nilpotent languages and their characterization by regular expressions
• scientific article; zbMATH DE number 4009842 (Why is no real title available?)
• scientific article; zbMATH DE number 475424 (Why is no real title available?)
• Semigroups of linear tree languages
• scientific article; zbMATH DE number 2143012 (Why is no real title available?)
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• On DR tree automata, unary algebras and syntactic path monoids

This page was built for publication: Classes of tree languages and DR tree languages given by classes of semigroups

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