Weak separation problem for tree languages

DOI10.1142/S0129054120500276MaRDI QIDQ5859635zbMATH OpenOpenAlexFDO

Authors Saeid Alirezazadeh, Khadijeh Alibabaei

Publication date 19 April 2021

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054120500276

zbMATH Keywords

recognizabilitysyntactic congruenceprofiniteweak separationforest algebrametric forest algebraforest language

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• On Pseudovarieties of Forest Algebras
• scientific article; zbMATH DE number 5872386
• scientific article; zbMATH DE number 5005936
• Wreath products of forest algebras, with applications to tree logics
• Piecewise testable tree languages

Cites work

• scientific article; zbMATH DE number 5872386 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 2107988 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• scientific article; zbMATH DE number 2213329 (Why is no real title available?)
• Algebraic characterization of logically defined tree languages
• Algebraic recognizability of regular tree languages
• Characterizing EF and EX tree logics
• Conjugacy separability of amalgamated free products of groups
• Efficient separability of regular languages by subsequences and suffixes
• Graphs and separability properties of groups
• ON SEPARABILITY PROPERTIES OF GROUPS
• On Pseudovarieties of Forest Algebras
• Piecewise testable tree languages
• Profinite semigroups and applications.
• STACS 2005
• Separating regular languages by piecewise testable and unambiguous languages
• Tree algebras and varieties of tree languages
• Universal algebra and applications in theoretical computer science

This page was built for publication: Weak separation problem for tree languages

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