Axiomatizing the equational theory of regular tree languages
type: Item
instance of: scholarly article
title: Axiomatizing the equational theory of regular tree languages
zbMATH Open document ID: 1184.68315
published in: The Journal of Logic and Algebraic Programming
publication date: 2010-02-05T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5666089
zbMATH Keywords: regular tree language
zbMATH Keywords: complex algebras
zbMATH Keywords: axiomatization
author: Zoltán Ésik
MaRDI profile type: Publication
full work available at URL: j.jlap.2009.10.001
OpenAlex ID: W2050307662
cites work: On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
cites work: Q4848740
cites work: Q3030266
cites work: STACS 2005
cites work: Q4348001
cites work: ITERATION ALGEBRAS
cites work: Equational axioms for regular sets
cites work: Q5287508
cites work: Solving polynomial fixed point equations
cites work: The equational logic of fixed points
cites work: Q4508392
cites work: Q4449535
cites work: Tree Languages Defined in First-Order Logic with One Quantifier Alternation
cites work: CONCUR 2004 - Concurrency Theory
cites work: Une remarque sur les systèmes complets d'identités rationnelles
cites work: Une condition impliquant toutes les identités rationnelles
cites work: Q4772711
cites work: Q5639639
cites work: A note on equations for commutative regular languages
cites work: On equations for union-free regular languages
cites work: IO and OI. I
cites work: Q3919058
cites work: Q3929061
cites work: Algebras of iteration theories
cites work: Independence of the equational axioms for iteration theories
cites work: Completeness of Park induction
cites work: Group axioms for iteration
cites work: A variety theorem for trees and theories
cites work: Q4381396
cites work: Continuous Additive Algebras and Injective Simulations of Synchronization Trees
cites work: Equational properties of iteration in algebraically complete categories
cites work: Algebraic recognizability of regular tree languages
cites work: Q3323279
cites work: Q4179852
cites work: Initial Algebra Semantics and Continuous Algebras
cites work: Algebraic semantics
cites work: The logic of recursive equations
cites work: Q4055972
cites work: Results on the propositional \(\mu\)-calculus
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Complete systems of \(\mathcal B\)-rational identities
cites work: Q4723706
cites work: Q3730012
cites work: Q5624635
cites work: Positive varieties of tree languages
cites work: Q4287490
cites work: Q5596826
cites work: Q5696196
cites work: Two Complete Axiom Systems for the Algebra of Regular Events
cites work: Q4273660
cites work: General varieties of tree languages
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Q3221429
cites work: Q4385530
cites work: Q4185836
DOI: 10.1016/J.JLAP.2009.10.001
description: scientific article; zbMATH DE number 5666089