LEADER 05247nam 22007455 450 001 9910484445503321 005 20230330041403.0 010 $a3-319-13350-0 024 7 $a10.1007/978-3-319-13350-8 035 $a(CKB)3710000000325018 035 $a(SSID)ssj0001408217 035 $a(PQKBManifestationID)11773998 035 $a(PQKBTitleCode)TC0001408217 035 $a(PQKBWorkID)11346942 035 $a(PQKB)10964313 035 $a(DE-He213)978-3-319-13350-8 035 $a(MiAaPQ)EBC6287421 035 $a(MiAaPQ)EBC5587176 035 $a(Au-PeEL)EBL5587176 035 $a(OCoLC)899062404 035 $a(PPN)183152247 035 $a(EXLCZ)993710000000325018 100 $a20141209d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing with New Resources $eEssays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday /$fedited by Cristian S. Calude, R?si?? Freivalds, Iwama Kazuo 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XXI, 473 p. 96 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8808 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-13349-7 327 $aCounting 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. 330 $aProfessor 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8808 606 $aComputer science 606 $aMachine theory 606 $aQuantum computers 606 $aAlgorithms 606 $aTheory of Computation 606 $aFormal Languages and Automata Theory 606 $aQuantum Computing 606 $aAlgorithms 615 0$aComputer science. 615 0$aMachine theory. 615 0$aQuantum computers. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aFormal Languages and Automata Theory. 615 24$aQuantum Computing. 615 24$aAlgorithms. 676 $a004 702 $aCalude$b Cristian S$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFreivalds$b R?si??$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKazuo$b Iwama$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484445503321 996 $aComputing with New Resources$92831685 997 $aUNINA