The following pages link to (Q3325046):
Displayed 15 items.
- Analogues of quantum complementarity in the theory of automata (Q639815) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- Quantization causes waves: smooth finitely computable functions are affine (Q895585) (← links)
- Computational complementarity and shift spaces (Q997483) (← links)
- Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Computational universes (Q2483574) (← links)
- Some more on the basis finite automaton (Q4981717) (← links)
- The p-adic Theory of Automata Functions (Q5044585) (← links)
- Computing Petri net languages by reductions (Q5055897) (← links)
- Two-Sided Strictly Locally Testable Languages (Q5164867) (← links)
- On Jaffe's pumping lemma, revisited (Q6175088) (← links)
- On Minimal Pumping Constants for Regular Languages (Q6204130) (← links)