Axiomatizing the equational theory of regular tree languages
From MaRDI portal
Publication:844887
DOI10.1016/J.JLAP.2009.10.001zbMath1184.68315OpenAlexW2050307662MaRDI QIDQ844887
Publication date: 5 February 2010
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2009.10.001
Related Items (8)
A connection between concurrency and language theory ⋮ Recognisable Languages over Monads ⋮ Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview ⋮ THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ Simulations of Weighted Tree Automata ⋮ From Tree Automata to Rational Tree Expressions ⋮ Equational theories for automata
Cites Work
- A note on equations for commutative regular languages
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- Algebras of iteration theories
- Results on the propositional \(\mu\)-calculus
- Independence of the equational axioms for iteration theories
- Equational properties of iteration in algebraically complete categories
- Algebraic semantics
- Complete systems of \(\mathcal B\)-rational identities
- IO and OI. I
- General varieties of tree languages
- Group axioms for iteration
- A completeness theorem for Kleene algebras and the algebra of regular events
- The equational logic of fixed points
- Completeness of Park induction
- On equations for union-free regular languages
- Algebraic recognizability of regular tree languages
- Positive varieties of tree languages
- Une remarque sur les systèmes complets d'identités rationnelles
- Initial Algebra Semantics and Continuous Algebras
- The logic of recursive equations
- Equational axioms for regular sets
- Une condition impliquant toutes les identités rationnelles
- Continuous Additive Algebras and Injective Simulations of Synchronization Trees
- Solving polynomial fixed point equations
- ITERATION ALGEBRAS
- CONCUR 2004 - Concurrency Theory
- Two Complete Axiom Systems for the Algebra of Regular Events
- Generalized finite automata theory with an application to a decision problem of second-order logic
- STACS 2005
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Axiomatizing the equational theory of regular tree languages
