Mathematical Foundations of Computer Science 2004

DOI10.1007/B99679zbMath1097.68078OpenAlexW2488008928MaRDI QIDQ5311161

Pascal Weil

Publication date: 22 August 2005

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

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (8)

Efficient algorithms for membership in Boolean hierarchies of regular languages ⋮ Definable transductions and weighted logics for texts ⋮ Logics for unordered trees with data constraints ⋮ Languages of dot-depth 3/2 ⋮ Fragments of first-order logic over infinite words ⋮ Algebraic recognizability of regular tree languages ⋮ Kleene Theorems for Product Systems ⋮ The recognizability of sets of graphs is a robust property

This page was built for publication: Mathematical Foundations of Computer Science 2004