Pages that link to "Item:Q844887"
From MaRDI portal
The following pages link to Axiomatizing the equational theory of regular tree languages (Q844887):
Displaying 17 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Axiomatizing the identities of binoid languages (Q870834) (← links)
- The congruence theory of closure properties of regular tree languages (Q917323) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- Equational theories for automata (Q2074221) (← links)
- Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
- Nested semantics over finite trees are equationally hard (invited talk) (Q2847402) (← links)
- Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview (Q2946322) (← links)
- Simulations of Weighted Tree Automata (Q3073652) (← links)
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA (Q3224952) (← links)
- Recognisable Languages over Monads (Q3451085) (← links)
- Duality and Equational Theory of Regular Languages (Q3519505) (← links)
- (Q4381396) (← links)
- From Tree Automata to Rational Tree Expressions (Q4963267) (← links)
- Equational properties of fixed-point operations in cartesian categories: An overview (Q5377703) (← links)