Where Mathematics, Computer Science, Linguistics and Biology Meet - Taschenbuch

EAN (ISBN-13): 9789048156078
ISBN (ISBN-10): 9048156076
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer
464 Seiten
Gewicht: 0,696 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2011-01-17T02:38:12+01:00 (Zurich)
Detailseite zuletzt geändert am 2022-08-08T10:29:25+02:00 (Zurich)
ISBN/EAN: 9789048156078

ISBN - alternative Schreibweisen:
90-481-5607-6, 978-90-481-5607-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: linguistics, mathematics for computer science cti

---

Daten vom Verlag:

Autor/in: Carlos Martín-Vide; V. Mitrana
Titel: Where Mathematics, Computer Science, Linguistics and Biology Meet - Essays in honour of Gheorghe Păun
Verlag: Springer; Springer Netherland
446 Seiten
Erscheinungsjahr: 2010-12-01
Dordrecht; NL
Gedruckt / Hergestellt in Niederlande.
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
POD
XVI, 446 p.

BC; Hardcover, Softcover / Mathematik/Grundlagen; Mathematik: Logik; Verstehen; Graph; Sim; algorithms; automata; complexity; computer; computer science; database; formal language; formal languages; genes; linguistics; modularity; combinatorics; Mathematical Logic and Foundations; History of Science; Mathematics of Computing; Discrete Mathematics; Artificial Intelligence; Computational Linguistics; Mathematische Grundlagen; Geschichte der Naturwissenschaften; Mathematik für Informatiker; Diskrete Mathematik; Künstliche Intelligenz; Computerlinguistik und Korpuslinguistik; BB

1 The Games of His Life.- I Grammars and Grammar Systems.- 2 Deterministic Stream X-Machines Based on Grammar Systems.- 3 Some Ghosts that Arise in a Spliced Linguistic String: Evidence from Catalan.- 4 On Size Complexity of Context-Free Returning Parallel Communicating Grammar Systems.- 5 Subregularly Controlled Derivations: Restrictions by Syntactic Parameters.- 6 Neo-Modularity and Colonies.- 7 Sewing Contexts and Mildly Context-Sensitive Languages.- 8 Towards Grammars of Decision Algorithms.- II Automata.- 9 Computational Complementarity for Probabilistic Automata.- 10 Acceptance of ?-Languages by Communicating Deterministic Turing Machines.- 11 Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints.- 12 Automata Arrays and Context-Free Languages.- 13 On Special Forms of Restarting Automata.- 14 The Time Dimension of Computation Models.- III Languages and Combinatorics.- 15 An Infinite Sequence of Full AFL-Structures, Each of Which Possesses an Infinite Hierarchy.- 16 Trellis Languages.- 17 Pictures, Layers, Double Stranded Molecules: On Multi-Dimensional Sentences.- 18 Transduction in Polypodes.- 19 Some Algebraic Properties of Contexts and Their Applications to Contextual Languages.- 20 On Fatou Properties of Rational Languages.- 21 Multiple Keyword Patterns in Context-Free Languages.- 22 Reading Words in Graphs Generated by Hyperedge Replacement.- 23 Regularly Controlled Formal Power Series.- 24 Forbidden Subsequences and Permutations Sortable on Two Parallel Stacks.- 25 Approximate Identification and Finite Elasticity.- 26 Insertion of Languages and Differential Semirings.- IV Models of Molecular Computing.- 27 Molecular Structures.- 28 A Characterization of Non-Iterated Splicing with Regular Rules.- 29 Universaland Simple Operations for Gene Assembly in Ciliates.- 30 Semi-Simple Splicing Systems.- 31 Writing By Methylation Proposed For Aqueous Computing.- 32 Context-Free Recombinations.- 33 Simplified Simple H Systems.- 34 On Some Forms of Splicing.- 35 Time-Varying Distributed H-Systems of Degree 2 Generate All Recursively Enumerable Languages.- 36 On Membrane Computing Based on Splicing.- 37 Is Evolutionary Computation Using DNA Strands Feasible?.- 38 Splicing Systems Using Merge and Separate Operations.