OPAL - OHIO PRIVATE ACADEMIC LIBRARIES / Muskingum

LEADER 00000cam  2200613Ia 4500 
001    607557660 
003    OCoLC 
005    20190405013843.7 
006    m     o  d         
007    cr cnu---unuuu 
008    100416s2006    enka    ob    001 0 eng d 
019    171124385|a171139444|a647519175|a668199894|a741249170
       |a815738470|a819628115|a847969752 
020    9780511648564|q(electronic bk.) 
020    0511648561|q(electronic bk.) 
020    0511224354 
020    9780511224355 
020    0511225024 
020    9780511225024 
035    (OCoLC)607557660|z(OCoLC)171124385|z(OCoLC)171139444
       |z(OCoLC)647519175|z(OCoLC)668199894|z(OCoLC)741249170
       |z(OCoLC)815738470|z(OCoLC)819628115|z(OCoLC)847969752 
040    N$T|beng|epn|erda|cN$T|dYDXCP|dOCLNG|dNRU|dOCLCQ|dIDEBK
       |dOCLCQ|dDEBSZ|dOCLCQ|dOCLCF|dOCLCQ|dE7B|dREDDC|dOCLCQ
       |dEBLCP|dOCL|dOCLCQ|dCOO 
049    MAIN 
050  4 QA267|b.A53 2006eb 
072  7 COM|x037000|2bisacsh 
082 04 511.35|222 
100 1  Anderson, James A.|q(James Andrew),|d1937-|0http://
       id.loc.gov/authorities/names/n96062598 
245 10 Automata theory with modern applications /|cJames A. 
       Anderson ; with contributions by Tom Head. 
264  1 Cambridge ;|aNew York :|bCambridge University Press,
       |c2006. 
300    1 online resource (viii, 255 pages) :|billustrations 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gpolychrome|2rdacc|0http://rdaregistry.info/termList/
       RDAColourContent/1003 
347    text file|2rdaft|0http://rdaregistry.info/termList/
       fileType/1002 
504    Includes bibliographical references and index. 
505 0  Cover -- Title -- Copyright -- Contents -- Preface -- 1 
       Introduction -- 1.1 Sets -- 1.2 Relations -- 1.3 Functions
       -- 1.4 Semigroups -- 2 Languages and codes -- 2.1 Regular 
       languages -- 2.2 Retracts (Optional) -- 2.3 Semiretracts 
       and lattices (Optional) -- 3 Automata -- 3.1 Deterministic
       and nondeterministic automata -- 3.2 Kleene's Theorem -- 
       3.3 Minimal deterministic automata and syntactic monoids -
       - Procedure -- 3.4 Pumping Lemma for regular languages -- 
       3.5 Decidability -- 3.6 Pushdown automata -- 3.7 Mealy and
       Moore machines -- 4 Grammars -- 4.1 Formal grammars -- 4.2
       Chomsky normal form and Greibach normal form -- 4.3 
       Pushdown automata and context-free languages -- 4.4 The 
       Pumping Lemma and decidability -- 5 Turing machines -- 5.1
       Deterministic Turing machines -- 5.2 Nondeterministic 
       Turing machines and acceptance of context-free languages -
       - 5.3 The halting problem for Turing machines -- 5.4 
       Undecidability problems for context-free languages -- 6 A 
       visual approach to formal languages -- 6.1 Introduction --
       6.2 A minimal taste of word combinatorics -- 6.3 The 
       spectrum of a word with respect to a language -- 6.4 The 
       spectral partition of Sigma+ and the support of L -- 6.5 
       Visualizing languages -- 6.6 The sketch parameters of a 
       language -- 6.7 Flag languages -- 6.8 Additional tools 
       from word combinatorics -- 6.9 Counting primitive words in
       a regular language -- 6.10 Algorithmic sketching of 
       regular languages -- 7 From biopolymers to formal language
       theory -- 7.1 Introduction -- 7.2 Constructing new words 
       by splicing together pairs of existing words -- 7.3 The 
       motivation from molecular biology -- 7.4 Splicing rules, 
       schemes, systems, and languages -- 7.5 Every splicing 
       language is a regular language -- 7.6 The syntactic monoid
       of a regular language L allows an effective determination 
       of the set of all splicing rules that respect L -- 7.7 It 
       is algorithmically decidable whether a given regular 
       language is a reflexive splicing language -- Appendix A: 
       Cardinality -- Appendix B: Co-compactness Lemma -- 
       References -- Further reading -- Index. 
520    Recent applications to bioscience have created a new 
       audience for automata theory and formal languages. This is
       the only introduction to cover such applications. With 
       over 350 exercises, many examples and illustrations, this 
       is an ideal contemporary introduction for students; others,
       new to the field, will welcome it for self-learning. 
588 0  Print version record. 
650  0 Machine theory.|0http://id.loc.gov/authorities/subjects/
       sh85079341 
650  0 Formal languages.|0http://id.loc.gov/authorities/subjects/
       sh85050802 
650  0 Molecular computers.|0http://id.loc.gov/authorities/
       subjects/sh96004522 
650  0 Machine theory|0http://id.loc.gov/authorities/subjects/
       sh85079341|vProblems, exercises, etc.|0http://id.loc.gov/
       authorities/subjects/sh99001553 
650  0 Formal languages|0http://id.loc.gov/authorities/subjects/
       sh85050802|vProblems, exercises, etc.|0http://id.loc.gov/
       authorities/subjects/sh99001553 
650  0 Molecular computers|0http://id.loc.gov/authorities/
       subjects/sh96004522|vProblems, exercises, etc.|0http://
       id.loc.gov/authorities/subjects/sh99001553 
655  4 Electronic books. 
655  7 Problems and exercises.|2fast|0http://id.worldcat.org/fast
       /1423783 
655  7 Problems and exercises.|2lcgft|0http://id.loc.gov/
       authorities/genreForms/gf2014026154 
700 1  Head, Thomas J.,|d1934-|0http://id.loc.gov/authorities/
       names/no2003068869 
776 08 |iPrint version:|aAnderson, James A. (James Andrew), 1937-
       |tAutomata theory with modern applications.|dCambridge ; 
       New York : Cambridge University Press, 2006|z9780521848879
       |w(OCoLC)170025104 
956 40 |uhttp://proxy.opal-libraries.org/login?url=http://
       search.ebscohost.com/login.aspx?direct=true&scope=site&
       db=nlebk&AN=304515|zView online 
990    eBooks on EBSCOhost|bEBSCO eBook Subscription Academic 
       Collection - North America|c2019-04-05|yAdded to 
       collection netlibrary.academicna|5OHN