Minimal reversible deterministic finite automata
From MaRDI portal
Recommendations
Cites work
- A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads
- A lower bound for reversible automata
- A simple and efficient universal reversible Turing machine
- Aspects of reversibility for classical automata
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 2086620 (Why is no real title available?)
- Inference of Reversible Languages
- Irreversibility and Heat Generation in the Computing Process
- Learning approximately regular languages with reversible languages
- Logical Reversibility of Computation
- Minimal and hyper-minimal biautomata (extended abstract)
- Nondeterministic Space is Closed under Complementation
- On the efficient construction of quasi-reversible automata for reversible languages
- One-way reversible multi-head finite automata
- Reversible multi-head finite automata characterize reversible logarithmic space
- Reversible pushdown automata
- Space-bounded hierarchies and probabilistic computations
- The method of forced enumeration for nondeterministic automata
- The parallel complexity of finite-state automata problems
- Two-way reversible multi-head finite automata
Cited in
(22)- Reversible nondeterministic finite automata
- Quotients and atoms of reversible languages
- Minimal and Reduced Reversible Automata
- The degree of irreversibility in deterministic finite automata
- A small minimal aperiodic reversible Turing machine
- Minimal reversible deterministic finite automata
- scientific article; zbMATH DE number 3907771 (Why is no real title available?)
- The degree of irreversibility in deterministic finite automata
- Minimal and reduced reversible automata
- Forbidden patterns for ordered automata
- Reversible pushdown transducers
- Finite automata with undirected state graphs
- Transducing reversibly with finite state machines
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
- Weakly and Strongly Irreversible Regular Languages
- Reversible Top-Down Syntax Analysis
- Reversible computations of one-way counter automata
- Reversible Two-Party Computations
- Decision problems for reversible and permutation automata
- A hierarchy of reversible finite automata
- Closure properties of subregular languages under operations
- Reversible top-down syntax analysis
This page was built for publication: Minimal reversible deterministic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640040)
