An algebraic characterization of frontier testable tree languages

DOI10.1016/0304-3975(95)00131-XzbMath0871.68110MaRDI QIDQ672861

Thomas Wilke

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

efficient algorithmpseudoidentities for tree algebras

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70)

Related Items (7)

Tree algebras and varieties of tree languages ⋮ Characterization of Logics over Ranked Tree Languages ⋮ ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES ⋮ Algebraic recognizability of regular tree languages ⋮ General varieties of tree languages ⋮ Algebra for trees ⋮ Positive varieties of tree languages

Cites Work

• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• The Birkhoff theorem for finite algebras
• On the computational power of pushdown automata
• A geometrical view of the determinization and minimization of finite-state automata
• Algebras for classifying regular tree languages and an application to frontier testability
• On reverse and general definite tree languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic characterization of frontier testable tree languages