Computing with New Resources Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday
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...
Saved in:
| Main Authors | , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Cham
Springer Nature
2014
Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Kazuo, Iwama Calude, Cristian S Freivalds, Rusins |
| Author_xml | – sequence: 1 fullname: Calude, Cristian S – sequence: 2 fullname: Freivalds, Rusins – sequence: 3 fullname: Kazuo, Iwama |
| BookMark | eNqNkEtPwzAQhM1TFOgPQOJQcUEcDGuvE9tHqHhJCCQEZ8tJN21piEucUn4-aYMQR06r0X4z2p19tl2Fihg7EnAuAPSF1YYjR2G5QEyAmw22j61cK9hkPZEKwRGV3fq72GY9QJDcaoW7rGeshVQqUHusH-MbAAgFRgrdY8fD8D5fNNNqPFhOm8ngkZaDZ4phUecUD9lO4ctI_Z95wF5vrl-Gd_zh6fZ-ePnAPSqAL16kkBe5TIpslGqDOUkPmVWk1Qi9zWxuc0zJoigo00CUmEJraQVp6bME8ICddbk-zmgZJ6FsovssKQthFl3bwe9npmUvOjbO6_Zqql1HCXCrxla0Q9fybm1wK8dp55jX4WNBsXHr4Jyqpvalu74aptJoJcU_yCQxWui0JU86MvfRl9Nq6t5DFca1n0-iS5SQibH4DbYRfVE |
| ContentType | eBook |
| Copyright | Springer International Publishing Switzerland 2014 |
| Copyright_xml | – notice: Springer International Publishing Switzerland 2014 |
| DBID | I4C |
| DEWEY | 005 |
| DOI | 10.1007/978-3-319-13350-8 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 3319133500 9783319133508 |
| EISSN | 1611-3349 |
| Edition | 1 2014 |
| Editor | Kazuo, Iwama Freivalds, Rūsiņ Calude, Cristian S |
| Editor_xml | – sequence: 1 fullname: Calude, Cristian S – sequence: 2 fullname: Freivalds, Rūsiņ – sequence: 3 fullname: Kazuo, Iwama |
| ExternalDocumentID | 9783319133508 331365 EBC6287421 EBC5587176 5412589 |
| GroupedDBID | 0D6 0DA 2HV 38. A0U A3- AABBV AAPCR ABBVZ ABFTD ABMNI ACKEY ACTXJ AEDXK AEKFX AETDV AEZAY AHJUR ALMA_UNASSIGNED_HOLDINGS ANZUN AZZ BBABE BZAQK CZZ I4C IEZ LDH NUC SAO SBO TPJZQ TSXQS Z7R Z7U Z7W Z7X Z7Y Z7Z Z81 Z83 Z84 Z85 Z87 Z88 AEJLV -DT -GH -~X 1SB 29L 2HA 5QI 875 AASHB ACGFS ADCXD AEFIE EJD F5P FEDTE HVGLF LAS P2P RIG RNI RSU SVGTG VI1 ~02 Z5O |
| ID | FETCH-LOGICAL-a3400x-f60cfc25fbd6783ce2a0b94e74d3a9b9c9c36e931feb70ee58f77291e72ab503 |
| ISBN | 3319133500 9783319133508 9783319133492 3319133497 |
| ISSN | 0302-9743 |
| IngestDate | Fri Nov 08 04:07:42 EST 2024 Wed Oct 30 02:38:42 EDT 2024 Fri May 30 22:57:45 EDT 2025 Fri May 30 23:26:53 EDT 2025 Tue Nov 14 22:47:46 EST 2023 |
| IsPeerReviewed | true |
| IsScholarly | true |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a3400x-f60cfc25fbd6783ce2a0b94e74d3a9b9c9c36e931feb70ee58f77291e72ab503 |
| OCLC | 899062404 |
| PQID | EBC5587176 |
| PageCount | 486 |
| ParticipantIDs | askewsholts_vlebooks_9783319133508 springer_books_10_1007_978_3_319_13350_8 proquest_ebookcentral_EBC6287421 proquest_ebookcentral_EBC5587176 casalini_monographs_5412589 |
| PublicationCentury | 2000 |
| PublicationDate | 2014. |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – year: 2014 text: 2014. |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesSubtitle | Theoretical Computer Science and General Issues |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationSeriesTitleAlternate | Lect.Notes Computer |
| PublicationYear | 2014 |
| Publisher | Springer Nature Springer International Publishing AG Springer International Publishing |
| Publisher_xml | – name: Springer Nature – name: Springer International Publishing AG – name: Springer International Publishing |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Naor, Moni Mitchell, John C. Terzopoulos, Demetri Steffen, Bernhard Pandu Rangan, C. Kanade, Takeo Kittler, Josef Weikum, Gerhard Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 9 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 10 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 11 givenname: Doug surname: Tygar fullname: Tygar, Doug – sequence: 12 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard |
| SSID | ssj0001408217 ssj0002792 |
| Score | 2.4725494 |
| Snippet | 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... |
| SourceID | askewsholts springer proquest casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer programming, programs, data Computer Science Mathematical Logic and Formal Languages Quantum Computing |
| Subtitle | Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday |
| TableOfContents | Intro -- Preface -- Jozef Gruska's Publications -- Contents -- Computing with Automata:Classical, Cellular and Systolic -- Counting with Probabilistic and Ultrametric Finite Automata -- 1 Introduction -- 2 Finite Automata -- 3 Probabilistic Automata -- 4 Ultrametric Automata -- 4.1 p-adic Numbers -- 4.2 Automata -- References -- Systolic Automata and P Systems -- 1 Introduction -- 2 Background -- 3 Multiset Binary Systolic Tree Automata -- 3.1 MBSTAs and MFAs -- 3.2 Regular MBSTAs -- 4 P Systems -- 4.1 Simulating RMBSTAs with P Systems -- 5 Conclusions -- References -- Soliton Automata with Multiple Waves -- 1 Solitons -- 2 Notation and Basic Notions -- 3 Soliton Graphs and Soliton Paths -- 4 Single-Soliton Automata -- 5 Multiple Soliton Waves Make a Difference -- 6 From Here, Where? -- References -- On Power Series over a Graded Monoid -- 1 Power Series over a Graded Monoid and a Decidability Result -- 2 Decidability Problems for Unambiguous Power Series -- References -- Advances on Random Sequence Generation by Uniform Cellular Automata -- 1 Introduction -- 2 Definition and Notation -- 2.1 Pseudo-Randomness -- 2.2 Cellular Automata -- 2.3 Boolean Functions -- 2.4 Some Properties of the Fourier-Hadamard Transform -- 3 Related Results -- 3.1 3-variable Boolean Update Function -- 3.2 4-variable Boolean Update Function -- 4 Exploring Radius 2, 1-Resilient Elementary CA Rules -- 4.1 Finding the Rules -- 4.2 Testing the Iterates -- 5 PRNG Testing -- 5.1 Randomness Preservation -- 5.2 Random Number Generation -- 6 Conclusion -- References -- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages -- 1 Introduction -- 2 Finite Automata and Image Representation -- 3 Determinizing Equal-Length Automata -- 4 A Lower Bound on the Determinization Blow-Up -- 5 Further Work -- References 2 Spontaneous Symmetry Breakdown and Deterministic Chaos -- 3 Quantum Beam Splitter -- 4 Quantum Vacuum Fluctuations -- 5 Analogies in Statistical Physics -- 5.1 Wigner's and Everett's Arguments Against Quantum Measurement -- 5.2 Analogies to the Second Law of Thermodynamics -- 6 Caveats and Afterthoughts -- References -- From Quantum Query Complexity to State Complexity -- 1 Introduction -- 2 Preliminaries -- 2.1 Exact Query Complexity -- 2.2 Communication Complexity -- 2.3 One-way Finite Automata with Quantum and Classical States -- 3 An Exact Quantum Query Algorithm for DJ'(x) -- 4 Communication Complexity of EQ'(x,y) -- 5 State Succinctness Results -- References -- Computing with Controlled Resources -- Small Universal Devices -- 1 Introduction -- 2 Models Based on String Rewriting -- 2.1 Turing Machines -- 2.2 Networks of Evolutionary Processors -- 3 Models Based on Circular String Rewriting -- 3.1 Tag Systems -- 3.2 Tag Systems with States -- 3.3 Bi-tag and Cyclic Tag Systems -- 3.4 Circular Post Machines -- 4 Models Based on Multiset Rewriting -- 4.1 Multiset Rewriting with Inhibitors -- 4.2 Register Machines -- 4.3 Maximally Parallel Multiset Rewriting -- 5 Models Based on Splicing -- 5.1 Double Splicing -- 5.2 (E)TVDH Systems -- 5.3 Test Tube Systems -- 5.4 Splicing P Systems -- 6 Conclusions -- References -- A Technique to Obtain Hardness Results for Randomized Online Algorithms -- A Survey -- 1 Introduction -- 2 The Main Theorem -- 3 Limits of this Approach -- 4 Applications -- 4.1 Job Shop Scheduling -- 4.2 L(2,1)-Coloring -- 4.3 The k-Server Problem -- References -- Integral Difference Ratio Functions on Integers -- 1 Introduction -- 2 Integral Difference Ratio and Newton Series -- 3 Unary lcm and Binomial Coefficients -- 4 Proof of Implication (1)(2) in Theorem 1 -- 5 Proof of Implication (2)(1) in Theorem 1 3.1 Evolutionary Circuit Design Aspects of Reversibility for Classical Automata -- 1 Introduction -- 2 Reversibility of Automata -- What Is It? -- 3 Finite-State Machines -- 4 Pushdown Automata -- 5 Time Symmetry -- References -- A Weakly Universal Cellular Automaton in the Pentagrid with Five States -- 1 Introduction -- 2 Universality and Weak Universality -- 3 The Scenario of Our Simulation -- 3.1 Basic Features -- 3.2 In the Pentagrid -- References -- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem -- 1 Introduction -- 2 The Firing Squad Synchronization Problem -- 3 Minimum Time Solutions to the FSSP -- 3.1 One-Dimensional Networks -- 3.2 Two and Higher Dimensions -- 3.3 Open Problems -- 4 Synchronization Algorithms in Particular Time -- References -- Time-Optimum Smaller-State Synchronizers for Cellular Automata -- 1 Introduction -- 2 FSSP on One-Dimensional Arrays -- 2.1 Definition of the FSSP -- 2.2 A Brief History of the Developments of Optimum-Time FSSP Algorithms -- 2.3 Complexity Measures and Properties in FSSP Algorithms -- 2.4 Generalized FSSP -- 2.5 One-Bit Solutions -- 3 FSSP on Two-Dimensional Arrays -- 3.1 Rectangular Arrays -- 3.2 Square Arrays -- 4 FSSP for Multi-Dimensional Arrays -- 4.1 3D FSSP/GFSSP Algorithms -- 4.2 kD FSSP/GFSSP Algorithms -- 5 Conclusions -- References -- Computing with Quantum Resources -- Computing Boolean Functions via Quantum Hashing -- 1 Introduction -- 2 Quantum Branching Programs -- 3 Quantum Hashing -- 4 Characteristic Polynomials for Boolean Functions -- 5 Computing Boolean Functions with Quantum Hashing -- 5.1 Examples -- References -- Complexity of Promise Problems on Classical and Quantum Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Arithmetics and Linear Algebra -- 2.2 Languages and Classical Finite Automata -- 2.3 Quantum Mechanics and Quantum Automata 6 Non Polynomial Functions Having Integral Difference Ratio -- 7 Conclusion -- References -- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 Extended Conditional T0L Systems -- 4 Non-Extended Conditional T0L Systems -- References -- Symmetries and Dualities in Name-Passing Process Calculi -- 1 Introduction -- 2 Background on Name-Passing Calculi -- 3 Typing and Subtyping with Fusions -- 4 A Calculus with Name Preorders -- 4.1 Preorders, Positive and Negative Occurrences -- 4.2 Types -- 4.3 Other Results -- 5 , a Symmetric -Calculus -- 5.1 Syntax and Operational Semantics -- 5.2 Types and Behavioural Equivalence -- 5.3 Duality -- 5.4 Further Results and Applications -- References -- Learning from Positive Data and Negative Counterexamples: A Survey -- 1 Introduction -- 2 Notation and Preliminaries -- 2.1 Concepts from Language Learning Theory -- 3 Learning with Negative Counterexamples -- 4 NCEx and NCBc Models -- 5 Learning with a Limited Number of Bounded Counterexamples -- 6 Iterative Learning Using Negative Counterexamples -- 7 Automatic NCEx-Learning -- References -- One-Sided Random Context Grammars: A Survey -- 1 Introduction -- 2 Preliminaries -- 3 Definitions and Examples -- 4 Results -- 5 Open Problems -- References -- How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? -- 1 Introduction -- 2 Reversible Logic Element with Memory (RLEM) -- 3 Constructing Reversible Machines by RE -- 4 Universality of 2-State RLEMs -- 5 Constructing RSMs by RLEMs 4-31 and 3-7 -- 6 Concluding Remarks -- References -- On Evolutionary Approximation of Logic Circuits -- 1 Introduction -- 2 Approximate Computing -- 2.1 Approximate Circuits -- 2.2 Systematic Design Methods -- 3 Evolutionary Approach to Approximate Circuits 3 Quantum Automata for Promise Problems -- 4 Classical Automata for Promise Problems -- References -- Quantum Complexity of Boolean Matrix Multiplication and Related Problems -- 1 Introduction -- 2 Preliminaries -- 2.1 Classical Query and Time Complexities -- 2.2 Generic Search Problems -- 2.3 Quantum Query and Time Complexities -- 3 Complexity of Triangle Finding, BPV and BMM -- 3.1 Standard Reductions Between the Three Problems -- 3.2 Status of These Problems -- 4 Boolean Matrix Multiplication and Triangle Finding -- 4.1 Graph-Theoretical Interpretation of BMM -- 4.2 Efficient Reduction -- 4.3 Implications: Towards Combinatorial Algorithms for BMM -- 5 Fast Quantum Algorithms for Matrix Multiplication -- 5.1 Rectangular Boolean Matrix Multiplication -- 5.2 Sparse Boolean Matrix Multiplication -- 5.3 Matrix Multiplication Over Semirings -- References -- Quantum Distributed Computing Applied to Grover's Search Algorithm -- 1 Introduction -- 2 Problem Statement -- 3 Theoretical Model -- 4 Results and Discussions -- 5 Conclusions -- References -- Maximally Entangled State in Pseudo-Telepathy Games -- 1 Introduction -- 2 Preliminaries -- 3 Results -- 4 Discussion -- References -- Quantum Finite Automata: A Modern Introduction -- 1 Introduction -- 2 Preliminaries -- 3 Basics of Quantum Computation -- 4 Quantum Beats Classical: Five QFA-Based Examples -- 4.1 A QFA Can Recognize Far More Tally Languages with Cutpoint -- 4.2 Nondeterministic QFAs Can Recognize Nonregular Languages -- 4.3 Succinct Exact Solution of Promise Problems -- 4.4 Succinct Bounded-Error Language Recognition -- 4.5 Bounded-Error Recognition of Nonregular Languages in Polynomial Time -- 5 General QFAs -- References -- Physical Aspects of Oracles for Randomness and Hadamard's Conjecture -- 1 Metamathematical and Metaphysical Origin of Oracles for Randomness |
| Title | Computing with New Resources |
| URI | http://digital.casalini.it/9783319133508 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5587176 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6287421 http://link.springer.com/10.1007/978-3-319-13350-8 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319133508 |
| Volume | 8808 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1Nb9Mw9Il1F3bhW5RtKEIckFBQEsdxfNiBjU5jVIXDhnaz7NS-DHUSCQjx6_eeHSdtNSGgh6j5aPPs5_f8vh_Aa8ZcQ-UK00IIkZalLpHmeJXK2iArRPm-WPoo30V1dlmeX_GrsZOnzy7pzLvm9515Jf-DVbyGeKUs2X_A7PCneAG_I37xiBjG45bwO5z2NQV8L4bBjkpBitEOH2Rker1tj-a9h2Bx0_nAq7exiUOk6XWlPy-3lP5o9NsyG46Wqw0tkSGZoSpaynVDIkNOiLpEYC42ML-KShqyUEI0ckek7_pOVrseXUGZUPgGnqX1uK9EX_ris_ry4VTNPy4-bd4MuyijQLsd2BGinsDu-9n5_OtoJKN22PmgQWdU7TC4hQLwlKwTBydCOaVxsNGH3ZcR3oByD_Z0e43bCG4xXUsyiW41paJuKBpbvnEvclw8hF1LeSiP4J5dPYYHEXFJj7gncDAsgoQWQYKLIBkWwVO4PJ1dnJylfa-LVDNko79SV2WNawruzBLlB0Z92jIjSyvKJdPSyEY2rLKS5c4akVnLa0eKUW5FoQ3P2DOYrG5W9jkktvJqQGNJPMSPltnSaSeptKPhzk3h1drY1c9v3i3fqnHyUGifwn6cEoVUE8qnt4qXKBDXcgpJnCXlf91HEqvZ8QnnqIOL6k-PVNRkocin8CZOsAogxBraCIpiCoFRHhpVv_j7R_fh_kgxBzDpvv-whyg4duZlv7xuAZ6EXyM |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Computing+with+New+Resources&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2014-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319133492&rft.issn=0302-9743&rft.eissn=1611-3349&rft.volume=8808&rft_id=info:doi/10.1007%2F978-3-319-13350-8&rft.externalDBID=NO_PDF_LINK&rft.externalDocID=331365 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833191%2F9783319133508.jpg |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-319-13350-8 |