The following pages link to Jozef Gruska (Q391187):
Displayed 50 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Multi-letter quantum finite automata: decidability of the equivalence and minimization of states (Q766174) (← links)
- (Q800101) (redirect page) (← links)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- Systolic automata for VLSI on balanced trees (Q1168737) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Quantum entanglement as a new information processing resource (Q1880335) (← links)
- Synthesis of quantum images using phase rotation (Q2110969) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- Entangling and disentangling in Grover's search algorithm (Q2415324) (← links)
- A characterization of context-free languages (Q2549240) (← links)
- (Q2742605) (← links)
- (Q2762126) (← links)
- (Q2770676) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Systolic trellis automata: Stability, decidability and complexity (Q3030260) (← links)
- (Q3100613) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- (Q3214432) (← links)
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA (Q3348431) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- Universal Sets of Quantum Information Processing Primitives and their optimal use (Q3439267) (← links)
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS (Q3444850) (← links)
- Algebraic Methods in Quantum Informatics (Q3522861) (← links)
- (Q3677178) (← links)
- Systolic trellis automatata † (Q3687722) (← links)
- Systolic trellis automatat† (Q3687723) (← links)
- (Q3711757) (← links)
- (Q3783573) (← links)
- (Q3795233) (← links)
- (Q4061989) (← links)
- (Q4105792) (← links)
- (Q4122828) (← links)
- (Q4348010) (← links)
- (Q4365822) (← links)
- (Q4496240) (← links)
- (Q4503144) (← links)
- (Q4529990) (← links)
- (Q4536451) (← links)
- (Q4536453) (← links)
- QUANTUM COMPLEXITY THEORY GOALS AND CHALLENGES (Q4663284) (← links)
- (Q4768641) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- (Q4864792) (← links)
- Testing Boolean Functions Properties (Q5025054) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)