scientific article; zbMATH DE number 7147440

zbMath1427.68178arXiv1804.06667MaRDI QIDQ5207048

Bartek Klin, Mikołaj Bojańczyk

Publication date: 3 January 2020

Full work available at URL: https://arxiv.org/abs/1804.06667

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

infinite treealgebraic language theory\(\omega\)-clone

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular languages of thin trees
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• The monadic theory of order
• An algebraic proof of Rabin's tree theorem
• Regular Languages of Words over Countable Linear Orderings
• Algebra for Infinite Forests with an Application to the Temporal Logic EF
• Definability equals recognizability for graphs of bounded treewidth
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: