The following pages link to Rational equivalence relations (Q1089801):
Displaying 18 items.
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Small overlap monoids. II: Automatic structures and normal forms. (Q1024392) (← links)
- Some decisional problems on rational relations (Q1390853) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Distances between languages and reflexivity of relations (Q1608895) (← links)
- Canonical equivalence relations on \(\mathbb Q^n\) (Q1771255) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- Rational equivalence of cusps (Q2193653) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- On finitely generated submonoids of virtually free groups (Q2317164) (← links)
- Program equivalence checking by two-tape automata (Q2452753) (← links)
- Regular path queries under approximate semantics (Q2502162) (← links)
- Formal descriptions of code properties: decidability, complexity, implementation (Q2909182) (← links)
- (Q4821404) (← links)
- Maximal r.e. equivalence relations (Q5752560) (← links)
- Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem (Q6114831) (← links)
