Pages that link to "Item:Q2720406"
From MaRDI portal
The following pages link to A Lower Bound For Reversible Automata (Q2720406):
Displaying 9 items.
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- On locally reversible languages (Q1034616) (← 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)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)
