{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":43,"n_cols":5,"rows_kept":43,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[17,2,17,3],[18,2,18,3],[22,2,22,3],[25,2,25,3],[25,4,25,5],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[34,2,34,3],[38,2,38,3],[39,2,39,3],[41,2,41,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466155003316"]
[null,null,"Titolo",null,"Developments in Language Theory [[electronic resource] ] : 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings / / edited by Zoltán Ésik, Zoltán Fülöp"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003"]
[null,null,"ISBN",null,"3-540-45007-6"]
[null,null,"Edizione",null,"[1st ed. 2003.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XI, 436 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2710"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Mathematical logic"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Computer logic"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Science, Humanities and Social Sciences, multidisciplinary"]
[{"$nulls":4},"Computation by Abstract Devices"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Invited Presentations -- Quantum Computing: 1-Way Quantum Automata -- An Automata-Theoretic Approach to Software Verification -- Comments on Complete Sets of Tree Automata -- On a Conjecture of Schnoebelen -- Restarting Automata and Their Relations to the Chomsky Hierarchy -- Test Sets for Large Families of Languages -- Complexity Theory Made Easy -- Contributions -- Synchronizing Monotonic Automata -- Covering Problems from a Formal Language Point of View -- Regular Languages Generated by Reflexive Finite Splicing Systems -- The Myhill-Nerode Theorem for Recognizable Tree Series -- Generating Series of the Trace Group -- Residual Finite Tree Automata -- From Glushkov WFAs to Rational Expressions -- NFA Reduction Algorithms by Means of Regular Inequalities -- Tile Rewriting Grammars -- Distributed Pushdown Automata Systems: Computational Power -- On Well Quasi-orders on Languages -- Frequency of Symbol Occurrences in Simple Non-primitive Stochastic "]
[{"$nulls":4},"Models -- On Enumeration of Müller Automata -- Branching Grammars: A Generalization of ET0L Systems -- Learning a Regular Tree Language from a Teacher -- On Three Classes of Automata-Like P Systems -- Computing Languages by (Bounded) Local Sets -- About Duval’s Conjecture -- Computation with Absolutely No Space Overhead -- Deleting String Rewriting Systems Preserve Regularity -- On Deterministic Finite Automata and Syntactic Monoid Size, Continued -- Flip-Pushdown Automata: Nondeterminism is Better than Determinism -- Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton -- Minimizing Finite Automata Is Computationally Hard -- Boolean Grammars -- Syntactic Semiring and Universal Automaton -- Alphabetic Pushdown Tree Transducers."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003. The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency."]
[null,"2.","Record Nr.",null,"UNINA9910484896603321"]
[null,null,"Autore",null,"Sontz Stephen Bruce"]
[null,null,"Titolo",null,"An Introductory Path to Quantum Theory : Using Mathematics to Understand the Ideas of Physics / / by Stephen Bruce Sontz"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020"]
[null,null,"ISBN",null,"3-030-40767-5"]
[null,null,"Edizione",null,"[1st ed. 2020.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXV, 286 p. 1 illus.)"]
[null,null,"Disciplina",null,"530.15"]
[{"$nulls":4},"530.12"]
[null,null,"Soggetti",null,"Mathematical physics"]
[{"$nulls":4},"Quantum physics"]
[{"$nulls":4},"Mathematical Physics"]
[{"$nulls":4},"Quantum Physics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Introduction to this Path -- Viewpoint -- Neither Particle nor Wave -- Schrödinger's Equation -- Operators and Canonical Quantization -- The Harmonic Oscillator -- Interpreting: Mathematics -- Interpreting: Physics -- The Language of Hilbert Space -- Interpreting: Measurement -- The Hydrogen Atom -- Angular Momentum -- The Rotation Group SO(3) -- Spin and SU(2) -- Bosons and Fermions -- Classical and Quantum Probability -- The Heisenberg Picture -- Uncertainty (Optional) -- Speaking of Quantum Theory (Optional) -- Complementarity (Optional) -- Axioms (Optional) -- And Gravity? -- Measure Theory: A Crash Course."]
[null,null,null,"Sommario/riassunto","Since the 17th century, physical theories have been expressed in the language of mathematical equations. This introduction to quantum theory uses that language to enable the reader to comprehend the notoriously non-intuitive ideas of quantum physics. The mathematical knowledge needed for using this book comes from standard undergraduate mathematics courses and is described in detail in the section Prerequisites. This text is especially aimed at advanced undergraduate and graduate students of mathematics, computer science, engineering and chemistry among other disciplines, provided they have the math background even though lacking preparation in physics. In fact, no previous formal study of physics is assumed."]