Algebraic recognizability of languages

DOI10.1007/978-3-540-28629-5_8MaRDI QIDQ5311161zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An algebraic characterization of data and timed languages
• Recognisability for algebras of infinite trees
• An algebraic approach to data languages and timed languages
• scientific article; zbMATH DE number 3874645
• Regular languages of words over countable linear orderings

Cited in

(19)

• Algorithmic problems and hierarchies of first-order languages
• Logics for unordered trees with data constraints
• Languages of dot-depth 3/2
• Algebraic recognizability of regular tree languages
• Algebraic properties of \(LA\)-languages
• The recognizability of sets of graphs is a robust property
• Three algebraic representation levels of the language
• Symbolic algorithms for language equivalence and Kleene algebra with tests
• An Algebraic Characterization of Strictly Piecewise Languages
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• scientific article; zbMATH DE number 3960994 (Why is no real title available?)
• scientific article; zbMATH DE number 18901 (Why is no real title available?)
• scientific article; zbMATH DE number 2050936 (Why is no real title available?)
• Recognizable languages in divisibility monoids
• scientific article; zbMATH DE number 871246 (Why is no real title available?)
• Kleene theorems for product systems
• Fragments of first-order logic over infinite words
• Recognizing number
• Definable transductions and weighted logics for texts

This page was built for publication: Algebraic recognizability of languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311161)