Weak Separation Problem for Tree Languages

DOI10.1142/S0129054120500276zbMATH Open1474.68197OpenAlexW3080321650MaRDI QIDQ5859635FDOQ5859635

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizing EF and EX tree logics
• Conjugacy separability of amalgamated free products of groups
• Algebraic recognizability of regular tree languages
• STACS 2005
• Graphs and separability properties of groups
• Efficient Separability of Regular Languages by Subsequences and Suffixes
• Universal algebra and applications in theoretical computer science
• Piecewise testable tree languages
• ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
• Tree algebras and varieties of tree languages
• ON SEPARABILITY PROPERTIES OF GROUPS
• On Pseudovarieties of Forest Algebras
• Separating Regular Languages by Piecewise Testable and Unambiguous Languages

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)