The following pages link to (Q4381396):
Displaying 13 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- The congruence theory of closure properties of regular tree languages (Q917323) (← links)
- The multiplicative fragment of the Yanov equational theory (Q1399998) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← 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)
- Residuated Park theories (Q3195621) (← links)
- A Kleene Theorem for Polynomial Coalgebras (Q3617725) (← links)
- Equational axioms for regular sets (Q4279247) (← links)
- Equational properties of fixed-point operations in cartesian categories: An overview (Q5377703) (← links)