The following pages link to (Q3763607):
Displaying 18 items.
- On the complexity of computing the profinite closure of a rational language (Q719326) (← links)
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- On locally reversible languages (Q1034616) (← links)
- Topologies for the free monoid (Q1173729) (← links)
- Learning approximately regular languages with reversible languages (Q1269920) (← links)
- Polynomial closure of group languages and open sets of the Hall topology (Q1349899) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- On the simulation of quantum Turing machines. (Q1401393) (← links)
- An axiomatic approach to reversible computation (Q2200840) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Quantum automata for some multiperiodic languages (Q2465050) (← links)
- Small size quantum automata recognizing some regular languages (Q2484448) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
