A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
From MaRDI portal
Publication:5207048
zbMATH Open1427.68178arXiv1804.06667MaRDI QIDQ5207048FDOQ5207048
Authors: Mikołaj Bojańczyk, Bartek Klin 
Publication date: 3 January 2020
Full work available at URL: https://arxiv.org/abs/1804.06667
Recommendations
Algebraic theory of languages and automata (68Q70) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- Regular languages of thin trees
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Title not available (Why is that?)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- Definability equals recognizability for graphs of bounded treewidth
- The monadic theory of order
- Title not available (Why is that?)
- COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
- An algebraic proof of Rabin's tree theorem
- Regular languages of words over countable linear orderings
Cited In (4)
This page was built for publication: A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207048)
