Pages that link to "Item:Q4640040"
From MaRDI portal
The following pages link to Minimal Reversible Deterministic Finite Automata (Q4640040):
Displaying 13 items.
- A small minimal aperiodic reversible Turing machine (Q340590) (← links)
- Reversible top-down syntax analysis (Q832945) (← links)
- Quotients and atoms of reversible languages (Q2139050) (← links)
- Minimal and Reduced Reversible Automata (Q2829980) (← links)
- (Q4988163) (← links)
- Reversible pushdown transducers (Q5918384) (← links)
- Finite automata with undirected state graphs (Q5918649) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata (Q6114868) (← links)
- Weakly and Strongly Irreversible Regular Languages (Q6114869) (← links)
- Reversible Top-Down Syntax Analysis (Q6169965) (← links)
- Reversible Two-Party Computations (Q6204131) (← links)
- Decision problems for reversible and permutation automata (Q6666806) (← links)