Algebraic recognizability of regular tree languages
From MaRDI portal
Publication:2484441
DOI10.1016/J.TCS.2005.03.038zbMATH Open1078.68100OpenAlexW2951818326MaRDI QIDQ2484441FDOQ2484441
Authors: Zoltán Ésik, Pascal Weil 
Publication date: 1 August 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.038
Recommendations
Cites Work
- Title not available (Why is that?)
- Matrix and matricial iteration theories. I
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorics on traces
- Handbook of Graph Grammars and Computing by Graph Transformation
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- STACS 2005
- Weak Second‐Order Arithmetic and Finite Automata
- Title not available (Why is that?)
- Decision Problems of Finite Automata Design and Related Arithmetics
- 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?)
- On the expressive power of temporal logic
- Mathematical Foundations of Computer Science 2004
- Universal algebra and applications in theoretical computer science
- Tree acceptors and some of their applications
- Title not available (Why is that?)
- Algebraic automata and context-free sets
- General varieties of tree languages
- Title not available (Why is that?)
- A variety theorem for trees and theories
- Algebraic characterization of logically defined tree languages
- Title not available (Why is that?)
- Basic notions of universal algebra for language theory and graph grammars
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- An algebraic characterization of frontier testable tree languages
- Automata in general algebras
- First-order logic on finite trees
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- The recognizability of sets of graphs is a robust property
- Title not available (Why is that?)
Cited In (15)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Weak Separation Problem for Tree Languages
- Axiomatizing the equational theory of regular tree languages
- \(S\)-preclones and the Galois connection \(^S\mathrm{Pol} - {^S\mathrm{Inv}}\). I.
- Title not available (Why is that?)
- Regular languages of thin trees
- Algebraic characterization of logically defined tree languages
- Varieties
- Recognisability for algebras of infinite trees
- Generalized quasiorders and the Galois connection End-gQuord
- Fuzzy tree language recognizability
- Algebra for trees
- Characterization of preclones by matrix collections
- A Kleene Theorem for Forest Languages
- On Pseudovarieties of Forest Algebras
This page was built for publication: Algebraic recognizability of regular tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484441)
