FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/b94618zbMath1196.68149OpenAlexW2246750081MaRDI QIDQ5191517

Zoltán Ésik, Pascal Weil

Publication date: 6 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94618

Mathematics Subject Classification ID

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

Related Items (8)

Recognisable Languages over Monads ⋮ A note on the characterization of TL [EF] ⋮ Tree algebras and varieties of tree languages ⋮ A syntactic congruence for languages of birooted trees ⋮ Algebraic recognizability of regular tree languages ⋮ Characterizing CTL-like logics on finite trees. ⋮ Positive varieties of tree languages ⋮ On labeled birooted tree languages: algebras, automata and logic

This page was built for publication: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science