The following pages link to (Q4737155):
Displaying 15 items.
- Bisimulations for fuzzy automata (Q423147) (← links)
- Introducing VAUCANSON (Q703498) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- On locally reversible languages (Q1034616) (← links)
- Reversible pushdown automata (Q1757838) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- Quantum Reversible Fuzzy Grammars (Q3305479) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- (Q5016363) (← links)
- (Q5016365) (← links)
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)
