• Publications
  • Influence
Quantum Computing
  • J. Gruska
  • Computer Science
    Wiley Encyclopedia of Computer Science and…
  • 2008
Systolic trellis automatat
TLDR
Theoretical results e.g. the closure of (homogeneous) systolic automaton under Boolean operations, or that every linear context free language can be accepted by a homogeneous systolics automaton and that their languages have time complexity 0(n2) are derived.
A Characterization of Context-free Languages
  • J. Gruska
  • Computer Science, Linguistics
    J. Comput. Syst. Sci.
  • 1 August 1971
Foundations of Computing
TLDR
The author's approach is to stimulate students' understanding of the relevance of theory to important application areas - for example, image processing, communication networks and cryptography are all discussed.
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
TLDR
It is shown that the states minimization problem of multi-letter QFAs is solvable in EXPSPACE and the decidability of the equivalence and minimization problems ofMulti-letter quantum finite automata is studied.
Systolic automata for VLSI on balanced trees
SummarySystolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable
On a classification of context-free languages
The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­
A Few Remarks on the Index of Context-Free Grammars and Languages
  • J. Gruska
  • Computer Science, Linguistics
    Inf. Control.
  • 1 October 1971
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings
TLDR
It is shown that the technique developed and the results obtained allow also to solve in optimal time & communication FSSP for several other variants of this problem on networks shaped as square grids, square toruses and rings.
...
...