Algebraic recognizability of regular tree languages
From MaRDI portal
Publication:2484441
Recommendations
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 4037246 (Why is no real title available?)
- scientific article; zbMATH DE number 4051033 (Why is no real title available?)
- scientific article; zbMATH DE number 51770 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 475413 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A variety theorem for trees and theories
- Algebraic automata and context-free sets
- Algebraic characterization of logically defined tree languages
- An algebraic characterization of frontier testable tree languages
- Automata in general algebras
- Basic notions of universal algebra for language theory and graph grammars
- Combinatorics on traces
- Decision Problems of Finite Automata Design and Related Arithmetics
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- First-order logic on finite trees
- General varieties of tree languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Handbook of Graph Grammars and Computing by Graph Transformation
- Mathematical Foundations of Computer Science 2004
- Matrix and matricial iteration theories. I
- On finite monoids having only trivial subgroups
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- On the expressive power of temporal logic
- STACS 2005
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The recognizability of sets of graphs is a robust property
- Tree acceptors and some of their applications
- Universal algebra and applications in theoretical computer science
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(17)- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Axiomatizing the equational theory of regular tree languages
- \(S\)-preclones and the Galois connection \(^S\mathrm{Pol} - {^S\mathrm{Inv}}\). I.
- scientific article; zbMATH DE number 5005936 (Why is no real title available?)
- Regular languages of thin trees
- Algebraic characterization of logically defined tree languages
- Varieties
- Recognisability for algebras of infinite trees
- Weak separation problem for tree languages
- A complexity approach to tree algebras: the bounded case
- Generalized quasiorders and the Galois connection End-gQuord
- Fuzzy tree language recognizability
- Algebra for trees
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- 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)
