Mathematical Foundations of Computer Science 2004
From MaRDI portal
Publication:5311161
DOI10.1007/b99679zbMath1097.68078MaRDI QIDQ5311161
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
68Q70: Algebraic theory of languages and automata
Related Items
Kleene Theorems for Product Systems, Efficient algorithms for membership in Boolean hierarchies of regular languages, Fragments of first-order logic over infinite words, Definable transductions and weighted logics for texts, Logics for unordered trees with data constraints, Languages of dot-depth 3/2, Algebraic recognizability of regular tree languages, The recognizability of sets of graphs is a robust property