| Publication | Date of Publication | Type |
|---|
| Lifting query complexity to time-space complexity for two-way finite automata | 2024-01-22 | Paper |
| Synthesis of quantum images using phase rotation | 2022-12-23 | Paper |
| Time-Space Complexity Advantages for Quantum Computing | 2022-12-09 | Paper |
| State complexity of SBTA languages | 2022-08-16 | Paper |
| Testing Boolean Functions Properties | 2022-02-01 | Paper |
| Improving the Success Probability for Shor’s Factorization Algorithm | 2020-05-28 | Paper |
| Entangling and disentangling in Grover's search algorithm | 2019-05-21 | Paper |
| Generalizations of the distributed Deutsch–Jozsa promise problem | 2017-04-03 | Paper |
| Promise problems solved by quantum and classical finite automata | 2017-02-14 | Paper |
| Potential of Quantum Finite Automata with Exact Acceptance | 2015-09-29 | Paper |
| Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata | 2015-05-04 | Paper |
| On the state complexity of semi-quantum finite automata | 2014-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5418251 | 2014-06-03 | Paper |
| On the State Complexity of Semi-quantum Finite Automata | 2014-03-31 | Paper |
| State succinctness of two-way finite automata with quantum and classical states | 2014-01-10 | Paper |
| One-Way Finite Automata with Quantum and Classical States | 2012-11-01 | Paper |
| Multi-letter quantum finite automata: decidability of the equivalence and minimization of states | 2012-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3100613 | 2011-11-24 | Paper |
| Universal Sets of Quantum Information Processing Primitives and Their Optimal Use | 2009-01-22 | Paper |
| Algebraic Methods in Quantum Informatics | 2008-09-04 | Paper |
| A broader view on the limitations of information processing and communication by nature | 2007-06-14 | Paper |
| THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS | 2007-06-05 | Paper |
| Universal Sets of Quantum Information Processing Primitives and their optimal use | 2007-05-29 | Paper |
| Different time solutions for the firing squad synchronization problem on basic grid networks | 2007-04-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| QUANTUM COMPLEXITY THEORY GOALS AND CHALLENGES | 2005-03-30 | Paper |
| Quantum entanglement as a new information processing resource | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762126 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536451 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536453 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496240 | 2002-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529990 | 2002-05-07 | Paper |
| Systolic tree and tree-like automata | 2002-02-13 | Paper |
| Quantum models and modes of computation and communication | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503144 | 2000-09-04 | Paper |
| Succinctness of descriptions of SBTA-languages | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365822 | 1998-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4348010 | 1997-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864792 | 1996-06-27 | Paper |
| Power of interconnections and of nondeterminism in regularY-tree systolic automata | 1995-12-13 | Paper |
| Synthesis, structure and power of systolic computations | 1990-01-01 | Paper |
| SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795233 | 1988-01-01 | Paper |
| Systolic trellis automata: Stability, decidability and complexity | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711757 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783573 | 1986-01-01 | Paper |
| Systolic trellis automatata † | 1984-01-01 | Paper |
| Systolic trellis automatat† | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677178 | 1984-01-01 | Paper |
| Systolic automata for VLSI on balanced trees | 1983-01-01 | Paper |
| On a family of L languages resulting from systolic tree automata | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105792 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061989 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4122828 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4768641 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5180870 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5678442 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3214432 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5652219 | 1972-01-01 | Paper |
| A characterization of context-free languages | 1971-01-01 | Paper |
| Complexity and unambiguity of context-free grammars and languages | 1971-01-01 | Paper |
| A few remarks on the index of context-free grammars and languages | 1971-01-01 | Paper |
| Some classifications of context-free languages | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5588669 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541336 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5541335 | 1966-01-01 | Paper |
| Isolable and weakly isolable sets | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5519139 | 1966-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5508287 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5343339 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5513765 | 1965-01-01 | Paper |
