AbstractWe show that a finite set of equation schemes together with the least fixed point rule gives a complete axiomatization of the valid identities of regular tree languages. This result is a generalization of Kozen’s axiomatization of the equational theory of regular word languages
We consider an extended algebra of regular events (languages) with intersection besides the usual op...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...
AbstractWe show that a finite set of equation schemes together with the least fixed point rule gives...
AbstractCourcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regu...
AbstractWe give a finite equational axiomatization for +-free identities of (regular) languages whic...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
International audienceWe consider rewriting of a regular language with a left-linear term rewriting ...
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discre...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
Abstract. A new tree automata framework, called equational tree au-tomata, is presented. In the newl...
Point-tree algebras, a class of equational three-sorted algebras are defined. The elements of sort t...
AbstractAlgebras of commutative languages consist of all subsets of a free commutative monoid over a...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
We consider an extended algebra of regular events (languages) with intersection besides the usual op...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...
AbstractWe show that a finite set of equation schemes together with the least fixed point rule gives...
AbstractCourcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regu...
AbstractWe give a finite equational axiomatization for +-free identities of (regular) languages whic...
We review the rudiments of the equational logic of (least) fixed points and provide some of its appl...
International audienceWe consider rewriting of a regular language with a left-linear term rewriting ...
In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discre...
Trees are defined as mappings from tree structures (in the graph-theoretic sense) into sets of symbo...
Abstract. A new tree automata framework, called equational tree au-tomata, is presented. In the newl...
Point-tree algebras, a class of equational three-sorted algebras are defined. The elements of sort t...
AbstractAlgebras of commutative languages consist of all subsets of a free commutative monoid over a...
AbstractWe consider an extended algebra of regular events (languages) with intersection besides the ...
AbstractWe show that for several classes of idempotent semirings the least fixed-point of a polynomi...
We consider an extended algebra of regular events (languages) with intersection besides the usual op...
We give a finitary axiomatization of the algebra of regular events involving only equations and equa...
We consider rewriting of a regular language with a left-linear term rewriting system. We showtwo com...
DOI
Add to ORKG