On sets generated by context-free grammars. - Jozef Gruska (Kybernetika, 1966)

On a classification of context-free languages. - Jozef Gruska (Kybernetika, 1967)

Unambiguity and ambiguity of context-free grammars and languages. - Jozef Gruska (IFIP Congress (1), 1968)

Some Classifications of Context-Free Languages - Jozef Gruska (Inf. Control., 1969)

A Characterization of Context-free Languages. - Jozef Gruska (J. Comput. Syst. Sci., 1971)

Complexity and Unambiguity of Context-Free Grammars and Languages - Jozef Gruska (Inf. Control., 1971)

A Few Remarks on the Index of Context-Free Grammars and Languages - Jozef Gruska (Inf. Control., 1971)

On the size of context-free grammars. - Jozef Gruska (Kybernetika, 1972)

Descriptional Complexity of Context-Free Languages. - Jozef Gruska (MFCS, 1973)

Generalized context-free grammars. - Jozef Gruska (Acta Cybern., 1973)

On star height hierarchies of context-free languages. - Jozef Gruska (Kybernetika, 1973)

Correction to: "On star height hierarchies of context-free languages". - Jozef Gruska (Kybernetika, 1973)

A note on ε-rules in context-free grammars. - Jozef Gruska (Kybernetika, 1975)

Descriptional Complexity (of Languages) - A Short Survey. - Jozef Gruska (MFCS, 1976)

Systolic Automata for VLSI on Balanced Trees. - Karel Culík II; Jozef Gruska; Arto Salomaa (Acta Informatica, 1982)

On a Family of L Languages Resulting from Systolic Tree Automata. - Karel Culík II; Jozef Gruska; Arto Salomaa (Theor. Comput. Sci., 1983)

Systolic Automata - Power, Characterizations, Nonhomogeneity. - Jozef Gruska (MFCS, 1984)

Pragmatic Aspects of Complexity Theory (Panel). - Jozef Gruska (IFIP Congress, 1986)

Systolic Trellis Automata: Stability, Decidability and Complexity - Karel Culík II; Jozef Gruska; Arto Salomaa (Inf. Control., 1986)

Systolic Architectures, Systems and Computations. - Jozef Gruska (ICALP, 1988)

Simulation of Systolic Tree Automata on Trellis Automata. - Emanuela Fachini; Jozef Gruska; Andrea Maggiolo-Schettini; Davide Sangiorgi (Int. J. Found. Comput. Sci., 1990)

Synthesis, Structure and Power of Systolic Computations. - Jozef Gruska (Theor. Comput. Sci., 1990)

On the Minimization and Succintness of Systolic Binary Tree Automata. - Jozef Gruska; Margherita Napoli; Domenico Parente (Sci. Ann. Cuza Univ., 1993)

Correctness of Basic Systolic Systems Transformations. - Jozef Gruska; Irène Guessarian (IFIP Congress (1), 1994)

Optimization of Systolic Tree Automata. - Jozef Gruska; Margherita Napoli; Domenico Parente (IFIP Congress (1), 1994)

State Complexity of SBTA Languages. - Jozef Gruska; Angelo Monti; Margherita Napoli; Domenico Parente (LATIN, 1995)

Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. - Emanuela Fachini; Jozef Gruska; Margherita Napoli; Domenico Parente (Math. Syst. Theory, 1995)

Towards Adjusting Informatics Education to Information Era. - Jozef Gruska; Roland Vollmar (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

Informatics in curricula for noninformaticsstudents: engineering and science. - Roland Vollmar; Jozef Gruska (Informatics in Higher Education, 1997)

Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. - Jozef Gruska; Irène Guessarian (J. Autom. Lang. Comb., 1997)

Succinctness of Descriptions of SBTA-Languages. - Jozef Gruska; Angelo Monti; Margherita Napoli; Domenico Parente (Theor. Comput. Sci., 1997)

Quantum Challenges for Computing. - Jozef Gruska (ARCS, 1999)

Quantum Challenges. - Jozef Gruska (SOFSEM, 1999)

Quantum Finite Automata. - Jozef Gruska; Roland Vollmar (Words, Languages & Combinatorics, 2000)

New Challenges for Theoretical Computer Science. - Jozef Gruska (IFIP TCS, 2000)

Quantumization of Theoretical Informatics. - Jozef Gruska (IFIP TCS, 2000)

Book Review: foundations of computing. - Jozef Gruska (XRDS, 2000)

Descriptional Complexity Issues in Quantum Computing. - Jozef Gruska (J. Autom. Lang. Comb., 2000)

Power, Puzzles and Properties of Entanglement. - Jozef Gruska; Hiroshi Imai (MCU, 2001)

Power of Quantum Entanglement. - Jozef Gruska; Hiroshi Imai; Keiji Matsumoto (IFIP TCS, 2002)

Succinctness in Quantum Information Processing. - Jozef Gruska (DCFS, 2003)

Invited Paper. Quantum Entanglement as a New Information Processing Resource. - Jozef Gruska (New Gener. Comput., 2003)

Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. - Jozef Gruska; Salvatore La Torre; Mimmo Parente (Developments in Language Theory, 2004)

Various Solutions to the Firing Squad Synchronization Problems - Jozef Gruska; Salvatore La Torre; Margherita Napoli; Mimmo Parente (CoRR, 2005)

Universal Sets of Quantum Information Processing Primitives and their optimal use. - Jozef Gruska (Electron. Notes Discret. Math., 2005)

From Informatics to Quantum Informatics. - Jozef Gruska (IFIP TCS, 2006)

The Emergence and Challenges of Quantum Informatics (Entstehung der Quanteninformatik und ihre Herausforderungen). - Jozef Gruska (it Inf. Technol., 2006)

Different time solutions for the firing squad synchronization problem on basic grid networks. - Jozef Gruska; Salvatore La Torre; Margherita Napoli; Mimmo Parente (RAIRO Theor. Informatics Appl., 2006)

Quantum Finite Automata. - Jozef Gruska (Recent Advances in Formal Languages and Applications, 2006)

Algebraic Methods in Quantum Informatics. - Jozef Gruska (CAI, 2007)

The Firing Squad Synchronization Problem on Squares, Toruses and Rings. - Jozef Gruska; Salvatore La Torre; Mimmo Parente (Int. J. Found. Comput. Sci., 2007)

A broader view on the limitations of information processing and communication by nature. - Jozef Gruska (Nat. Comput., 2007)

Quantum Computing. - Jozef Gruska (Wiley Encyclopedia of Computer Science and Engineering, 2008)

Roots and Stimuli to a New Perception of Informatics. - Jozef Gruska (Rainbow of Computer Science, 2011)

Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. - Daowen Qiu; Lvzhou Li; Xiangfu Zou; Paulo Mateus; Jozef Gruska (Acta Informatica, 2011)

One-Way Finite Automata with Quantum and Classical States. - Shenggen Zheng; Daowen Qiu; Lvzhou Li; Jozef Gruska (Languages Alive, 2012)

Quantum Finite Automata. - Daowen Qiu; Lvzhou Li; Paulo Mateus; Jozef Gruska (Handbook of Finite State Based Models and Applications, 2012)

Roads to New Grand Challenges of Informatics - (Extended Abstract). - Jozef Gruska (Int. Conf. on Membrane Computing, 2013)

Communication complexity of promise problems and their applications to finite automata. - Jozef Gruska; Daowen Qiu; Shenggen Zheng (CoRR, 2013)

New Vision and Goals of Informatics and Megachallenges of Mankind. Extended abstract. - Jozef Gruska (Comput. Sci. J. Moldova, 2013)

State succinctness of two-way finite automata with quantum and classical states. - Shenggen Zheng; Daowen Qiu; Jozef Gruska; Lvzhou Li; Paulo Mateus (Theor. Comput. Sci., 2013)

Grand Challenges of Informatics. - Jozef Gruska (Computing with New Resources, 2014)

Exact query complexity of some special classes of Boolean functions. - Andris Ambainis; Jozef Gruska; Shenggen Zheng (CoRR, 2014)

Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework. - Jozef Gruska; Lvzhou Li; Shenggen Zheng (CoRR, 2014)

On the state complexity of semi-quantum finite automata. - Shenggen Zheng; Jozef Gruska; Daowen Qiu (RAIRO Theor. Informatics Appl., 2014)

Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. - Shenggen Zheng; Daowen Qiu; Jozef Gruska (Inf. Comput., 2015)

Potential of Quantum Finite Automata with Exact Acceptance. - Jozef Gruska; Daowen Qiu; Shenggen Zheng (Int. J. Found. Comput. Sci., 2015)

Exact quantum algorithms have advantage for almost all Boolean functions. - Andris Ambainis; Jozef Gruska; Shenggen Zheng (Quantum Inf. Comput., 2015)

Rūsiņš Mārtiņš Freivalds. Remarkable Scholar, Unique Teacher and Great Man. - Jozef Gruska (Balt. J. Mod. Comput., 2016)

Time-Space Complexity Advantages for Quantum Computing. - Shenggen Zheng; Daowen Qiu; Jozef Gruska (TPNC, 2017)

Generalizations of the distributed Deutsch-Jozsa promise problem. - Jozef Gruska; Daowen Qiu; Shenggen Zheng (Math. Struct. Comput. Sci., 2017)

Promise problems solved by quantum and classical finite automata. - Shenggen Zheng; Lvzhou Li; Daowen Qiu; Jozef Gruska (Theor. Comput. Sci., 2017)

Improving the Success Probability for Shor's Factorization Algorithm. - Guoliang Xu; Daowen Qiu; Xiangfu Zou; Jozef Gruska (Reversibility and Universality, 2018)

Synthesis of quantum images using phase rotation. - Shiping Du; Daowen Qiu; Jozef Gruska; Paulo Mateus (Quantum Inf. Process., 2019)

Entangling and disentangling in Grover's search algorithm. - Minghua Pan; Daowen Qiu; Paulo Mateus; Jozef Gruska (Theor. Comput. Sci., 2019)

Multiple-pulse phase-matching quantum key distribution. - Gang Chen; Le Wang; Wei Li 215; Yang Zhao; Sheng-Mei Zhao; Jozef Gruska (Quantum Inf. Process., 2020)

Security improvements of several basic quantum private query protocols with O(log N) communication complexity. - Fang Yu; Daowen Qiu; Xiaoming Wang; Qin Li 009; Lvzhou Li; Jozef Gruska (Theor. Comput. Sci., 2020)

Testing Boolean Functions Properties. - Zhengwei Xie; Daowen Qiu; Guangya Cai; Jozef Gruska; Paulo Mateus (Fundam. Informaticae, 2021)

Lifting query complexity to time-space complexity for two-way finite automata. - Shenggen Zheng; Yaqiao Li; Minghua Pan; Jozef Gruska; Lvzhou Li (J. Comput. Syst. Sci., 2024)