Figure 1.
The State Diagram of a Typical DFA.
Figure 2.
Quantum Automaton with Quantum Realization of DFA of Figure 1.
Figure 3.
The State Diagram of a General QFA.
Figure 4.
The State Diagram of a General QFA with Uσi Using Chrestenson Family Matrix.
Figure 5.
The State Diagram of a Normal Classical DFA Machine M1.
Figure 6.
QFA Machine M2 Based on Rotation Ternary Quantum Circuits using Plus1 and Plus2 Ternary Operations.
Figure 7.
Machine M_combo1 with Logic AND of Machines M1 and M2.
Figure 8.
Machine M3 and Machine M5.
Figure 9.
Machine M_combo2 with Logic AND of Machines M3 and M5.
Figure 10.
Machine M_combo3 with Logic AND of Machines M17, M23, M31.
Figure 11.
GHQFA Application in Robotics.
Figure 12.
HR-OS5 Humanoid Robot Actor.
Figure 13.
QFSMD Quantum Finite State Machine with Datapath for Language Recognition.
| Abbreviation & Parameter | Meaning |
| QFA | Quantum Finite Automaton |
| QFSM | Quantum Finite State Machines |
| DFA | Deterministic Finite Automaton |
| QFSMD | Quantum Finite State Machine with Data Path |
| γ | The complex third root of unity for Chrestenson gate |
| CH | Chrestenson gate |
| CH2, CH3 | New counterpart of Chrestenson gate |
| (1 2) | CH2: Power of Chrestenson gate CH |
| (0 2) | CH22: Power of new counterpart of Chrestenson gate CH2 |
| (0 1) | CH32: Power of new counterpart of Chrestenson gate CH3 |
| CHC1, CHC2 | Extended Chrestenson gate unitary matrices |
| Plus1 | Plus1 ternary rotation matrix |
| Plus2 | Plus2 ternary rotation matrix |
| GHQFA | Generalized Hybrid Quantum Finite Automata |
| FSMD | Finite State Machine with Data Path |
| GHQFSMD | Generalized Hybrid Quantum Finite Automata with Datapath |