UID:
almahu_9947363876602882
Format:
XXI, 473 p. 96 illus.
,
online resource.
ISBN:
9783319133508
Series Statement:
Lecture Notes in Computer Science, 8808
Content:
Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced the descriptional complexity of grammars, automata, and languages, and is one of the pioneers of parallel (systolic) automata. His other main research interests include parallel systems and automata, as well as quantum information processing, transmission, and cryptography. He is co-founder of four regular series of conferences in informatics and two in quantum information processing and the Founding Chair (1989-96) of the IFIP Specialist Group on Foundations of Computer Science.
Note:
Counting With Probabilistic and Ultrametric Finite Automata -- Systolic Automata and P Systems -- Soliton Automata with Multiple Waves -- On Power Series over a Graded Monoid -- Advances on Random Sequence Generation by Uniform Cellular Automata -- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages -- Aspects of Reversibility for Classical Automata -- A Weakly Universal Cellular Automaton in the Pentagrid with Five States -- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem -- Time-Optimum Smaller-State Synchronizers for Cellular Automata -- Computing Boolean Functions via Quantum Hashing -- Complexity of Promise Problems on Classical and Quantum Automata -- Quantum Complexity of Boolean Matrix Multiplication and Related Problems -- Quantum Distributed Computing Applied to Grover's Search Algorithm -- Maximally Entangled State in Pseudo-Telepathy Games -- Quantum Finite Automata: A Modern Introduction -- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture -- From Quantum Query Complexity to State Complexity -- Small Universal Devices -- A Technique to Obtain Hardness Results for Randomized Online Algorithms -- Integral Difference Ratio Functions on Integers -- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources -- Symmetries and Dualities in Name-Passing Process Calculi -- Learning from Positive Data and Negative Counterexamples -- One-Sided Random Context Grammars -- How Can We Construct Reversible Machines out of Reversible Logic Element with Memory? -- On Evolutionary Approximation of Logic Circuits -- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems -- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds -- P Systems with Anti-Matter -- A Robust Universal Flying Amorphous Computer -- Minimal Reaction Systems Defining Subset Functions -- Grand Challenges of Informatics -- Konrad Zuse's Relationship to Informatics.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783319133492
Language:
English
DOI:
10.1007/978-3-319-13350-8
URL:
http://dx.doi.org/10.1007/978-3-319-13350-8
Bookmarklink
