LEADER 04376nam 22005055 450 001 9910770259503321 005 20240627173349.0 010 $a9783031439735 024 7 $a10.1007/978-3-031-43973-5 035 $a(CKB)29437196600041 035 $a(MiAaPQ)EBC31027302 035 $a(Au-PeEL)EBL31027302 035 $a(DE-He213)978-3-031-43973-5 035 $a(EXLCZ)9929437196600041 100 $a20231218d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aProgramming-Based Formal Languages and Automata Theory $eDesign, Implement, Validate, and Prove /$fby Marco T. Morazán 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (530 pages) 225 1 $aTexts in Computer Science,$x1868-095X 311 08$a9783031439728 327 $aPart I: Fundamental Concepts -- 1. Introduction to FSM -- 2. Essential Background -- 3. Types of Proofs -- Part II: Regular Languages -- 4. Regular Expressions -- 5. Deterministic Finite-State Machines -- 6. Nondeterministic Finite State Machines -- 7. Finite-State Automatons and Regular Expressions -- 8. Regular Grammars -- 9. Languages that are not Regular -- Part III: Context-Free Languages -- 10. Context-Free Grammars -- 11. Pushdown Automata -- 12. Equivalence of pdas and cfgs -- 13. Properties of Context-Free Languages -- 14. Deterministic PDAs -- Part IV: Context-Sensitive Languages -- 15. Turing Machines -- 16. Turing Machine Composition -- 17. Turing Machine Extensions -- 18. Context-Sensitive Grammars -- 19. Church-Turing Thesis and Undecidability -- 20. Complexity -- Part V: Epilogue -- 21. Where to Go From Here. 330 $aThis textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, and algorithms developed as part of a constructive proof are intended to be rendered as programs. The book is divided into four parts that build on each other. Part I reviews fundamental concepts. It introduces programming in FSM and reviews program design. In addition, it reviews essential mathematical background on sets, relations, and reasoning about infinite sets. Part II starts the study of formal languages and automata theory in earnest with regular languages. It first introduces regular expressions and shows how they are used to write programs that generate words in a regular language. Given that regular expressions generate words, it is only natural to ask how a machine can recognize words in a regular language. This leads to the study of deterministic and nondeterministic finite-state machines. Part III starts the exploration of languages that are not regular with context-free languages. It begins with context-free grammars and pushdown automata to generate and recognize context-free languages, and it ends with a discussion of deterministic pushdown automata and illustrates why these automatons are fundamentally different from nondeterministic pushdown automata. Part IV eventually explores languages that are not context-free, known as context-sensitive languages. It starts by discussing the most powerful automaton known to mankind: the Turing machine. It then moves to grammars for context-sensitive languages, and their equivalence with Turing machines is explored. The book ends with a brief chapter introducing complexity theory and explores the question of determining if a solution to a problem is practical. 410 0$aTexts in Computer Science,$x1868-095X 606 $aMachine theory 606 $aSoftware engineering 606 $aFormal Languages and Automata Theory 606 $aSoftware Engineering 615 0$aMachine theory. 615 0$aSoftware engineering. 615 14$aFormal Languages and Automata Theory. 615 24$aSoftware Engineering. 676 $a005.131 700 $aMoraza?n$b Marco T.$01078509 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910770259503321 996 $aProgramming-Based Formal Languages and Automata Theory$93660326 997 $aUNINA LEADER 05564nam 22008415 450 001 9910767506003321 005 20251226200253.0 010 $a3-540-45768-2 024 7 $a10.1007/11875741 035 $a(CKB)1000000000283773 035 $a(SSID)ssj0000316800 035 $a(PQKBManifestationID)11274448 035 $a(PQKBTitleCode)TC0000316800 035 $a(PQKBWorkID)10276360 035 $a(PQKB)11196538 035 $a(DE-He213)978-3-540-45768-8 035 $a(MiAaPQ)EBC3068258 035 $a(PPN)123138663 035 $a(BIP)34164349 035 $a(BIP)13637548 035 $a(EXLCZ)991000000000283773 100 $a20100324d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputational Life Sciences II $eSecond International Symposium, CompLife 2006, Cambridge, UK, September 27-29, 2006, Proceedings /$fedited by Michael R. Berthold, Robert Glen, Ingrid B. Fischer 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XIII, 269 p.) 225 1 $aLecture Notes in Bioinformatics,$x2366-6331 ;$v4216 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-45767-4 320 $aIncludes bibliographical references and index. 327 $aGenomics -- Improved Robustness in Time Series Analysis of Gene Expression Data by Polynomial Model Based Clustering -- A Hybrid Grid and Its Application to Orthologous Groups Clustering -- Promoter Prediction Using Physico-Chemical Properties of DNA -- Parametric Spectral Analysis of Malaria Gene Expression Time Series Data -- An Efficient Algorithm for Finding Long Conserved Regions Between Genes -- The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders -- Data Mining -- Building Structure-Property Predictive Models Using Data Assimilation -- Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models -- Relational Subgroup Discovery for Descriptive Analysis of Microarray Data -- Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph -- High-Throughput Identification of Chemistry in Life Science Texts -- Beating the Noise: New Statistical Methods for Detecting Signals in MALDI-TOF Spectra Below Noise Level -- Molecular Simulation -- Dynamic Complexity of Chaotic Transitions in High-Dimensional Classical Dynamics: Leu-Enkephalin Folding -- Solvent Effects and Conformational Stability of a Tripeptide -- Grid Assisted Ensemble Molecular Dynamics Simulations of HIV-1 Proteases Reveal Novel Conformations of the Inhibitor Saquinavir -- Molecular Informatics -- A Structure-Based Analysis of Single Molecule Force Spectroscopy (SMFS) Data for Bacteriorhodopsin and Four Mutants -- Classifying the World Anti-Doping Agency?s 2005 Prohibited List Using the Chemistry Development Kit Fingerprint -- A Point-Matching Based Algorithm for 3D Surface Alignment of Drug-Sized Molecules -- Systems Biology -- Adaptive Approach for Modelling Variability in Pharmacokinetics -- A New Approach to Flux Coupling Analysis of MetabolicNetworks -- Biological Networks / Metabolism -- Software Supported Modelling in Pharmacokinetics -- On the Interpretation of High Throughput MS Based Metabolomics Fingerprints with Random Forest -- Construction of Correlation Networks with Explicit Time-Slices Using Time-Lagged, Variable Interval Standard and Partial Correlation Coefficients -- Computational Neuroscience -- The Language of Cortical Dynamics -- A Simple Method to Simultaneously Track the Numbers of Expressed Channel Proteins in a Neuron. 330 $aThis book constitutes the refereed proceedings of the Second International Symposium on Computational Life Sciences, CompLife 2006. The 25 revised full papers presented were carefully reviewed and selected from 56 initial submissions. The papers are organized in topical sections on genomics, data mining, molecular simulation, molecular informatics, systems biology, biological networks/metabolism, and computational neuroscience. 410 0$aLecture Notes in Bioinformatics,$x2366-6331 ;$v4216 606 $aLife sciences 606 $aComputer science 606 $aInformation storage and retrieval systems 606 $aMedical informatics 606 $aDatabase management 606 $aApplication software 606 $aLife Sciences 606 $aTheory of Computation 606 $aInformation Storage and Retrieval 606 $aHealth Informatics 606 $aDatabase Management 606 $aComputer and Information Systems Applications 615 0$aLife sciences. 615 0$aComputer science. 615 0$aInformation storage and retrieval systems. 615 0$aMedical informatics. 615 0$aDatabase management. 615 0$aApplication software. 615 14$aLife Sciences. 615 24$aTheory of Computation. 615 24$aInformation Storage and Retrieval. 615 24$aHealth Informatics. 615 24$aDatabase Management. 615 24$aComputer and Information Systems Applications. 676 $a572.80285 701 $aBerthold$b M$g(Michael)$0133096 701 $aGlen$b Robert$g(Robert Charles)$01751732 701 $aFischer$b Ingrid$01751733 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767506003321 996 $aComputational life sciences II$94186830 997 $aUNINA