Axiomatizing the equational theory of regular tree languages

DOI10.1016/J.JLAP.2009.10.001MaRDI QIDQ844887zbMATH OpenOpenAlexFDO

Authors Zoltán Ésik

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

zbMATH Keywords

axiomatizationcomplex algebrasregular tree language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1136085
• scientific article; zbMATH DE number 2087210
• Equational axioms for regular sets
• The equational theory of regular words
• Monodic Tree Kleene Algebra

Cites work

• scientific article; zbMATH DE number 4018407 (Why is no real title available?)
• scientific article; zbMATH DE number 3888931 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• scientific article; zbMATH DE number 3731311 (Why is no real title available?)
• scientific article; zbMATH DE number 3744559 (Why is no real title available?)
• scientific article; zbMATH DE number 3470374 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 3622981 (Why is no real title available?)
• scientific article; zbMATH DE number 475413 (Why is no real title available?)
• scientific article; zbMATH DE number 549971 (Why is no real title available?)
• scientific article; zbMATH DE number 1047921 (Why is no real title available?)
• scientific article; zbMATH DE number 1136085 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2040320 (Why is no real title available?)
• scientific article; zbMATH DE number 1512703 (Why is no real title available?)
• scientific article; zbMATH DE number 3995637 (Why is no real title available?)
• scientific article; zbMATH DE number 3448081 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3316966 (Why is no real title available?)
• scientific article; zbMATH DE number 3349291 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• scientific article; zbMATH DE number 2213329 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• A note on equations for commutative regular languages
• A variety theorem for trees and theories
• Algebraic recognizability of regular tree languages
• Algebraic semantics
• Algebras of iteration theories
• CONCUR 2004 - Concurrency Theory
• Complete systems of \(\mathcal B\)-rational identities
• Completeness of Park induction
• Continuous Additive Algebras and Injective Simulations of Synchronization Trees
• Equational axioms for regular sets
• Equational properties of iteration in algebraically complete categories
• General varieties of tree languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Group axioms for iteration
• IO and OI. I
• ITERATION ALGEBRAS
• Independence of the equational axioms for iteration theories
• Initial Algebra Semantics and Continuous Algebras
• On equations for union-free regular languages
• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• Positive varieties of tree languages
• Results on the propositional \(\mu\)-calculus
• STACS 2005
• Solving polynomial fixed point equations
• The equational logic of fixed points
• The logic of recursive equations
• Two Complete Axiom Systems for the Algebra of Regular Events
• Une condition impliquant toutes les identités rationnelles
• Une remarque sur les systèmes complets d'identités rationnelles

Cited in

(18)

• Equational properties of fixed point operations in Cartesian categories: an overview
• A connection between concurrency and language theory
• scientific article; zbMATH DE number 1136085 (Why is no real title available?)
• The multiplicative fragment of the Yanov equational theory
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Axiomatizing the identities of binoid languages
• Recognisable languages over monads
• Equational properties of fixed-point operations in Cartesian categories: an overview
• Simulations of weighted tree automata
• From tree automata to rational tree expressions
• Axiomatizing weighted synchronization trees and weighted bisimilarity
• The congruence theory of closure properties of regular tree languages
• Duality and Equational Theory of Regular Languages
• Equational theories for automata
• Nested semantics over finite trees are equationally hard (invited talk)
• THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
• Infinitary axiomatization of the equational theory of context-free languages
• Infinitary axiomatization of the equational theory of context-free languages

This page was built for publication: Axiomatizing the equational theory of regular tree languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844887)