Automata theory with modern applications /:
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 fiel...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2006.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (viii, 255 pages) : illustrations |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9780511648564 0511648561 0511224354 9780511224355 0511225024 9780511225024 9780511607202 0511607202 9780521848879 0521848873 9780521613248 0521613248 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn607557660 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 100416s2006 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d OCLNG |d NRU |d OCLCQ |d IDEBK |d OCLCQ |d DEBSZ |d OCLCQ |d OCLCF |d OCLCQ |d E7B |d REDDC |d OCLCQ |d EBLCP |d OCL |d OCLCQ |d COO |d OL$ |d OCLCQ |d LUN |d OCLCQ |d OCLCO |d INTCL |d UKAHL |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SFB | ||
| 019 | |a 171124385 |a 171139444 |a 647519175 |a 668199894 |a 741249170 |a 815738470 |a 819628115 |a 847969752 |a 1167837396 | ||
| 020 | |a 9780511648564 |q (electronic bk.) | ||
| 020 | |a 0511648561 |q (electronic bk.) | ||
| 020 | |a 0511224354 | ||
| 020 | |a 9780511224355 | ||
| 020 | |a 0511225024 | ||
| 020 | |a 9780511225024 | ||
| 020 | |a 9780511607202 |q (ebook) | ||
| 020 | |a 0511607202 | ||
| 020 | |a 9780521848879 |q (hardback) | ||
| 020 | |a 0521848873 | ||
| 020 | |a 9780521613248 |q (paperback) | ||
| 020 | |a 0521613248 | ||
| 035 | |a (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 |z (OCoLC)1167837396 | ||
| 050 | 4 | |a QA267 |b .A53 2006eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 082 | 7 | |a 511.35 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Anderson, James A. |q (James Andrew), |d 1937- |1 https://id.oclc.org/worldcat/entity/E39PCjKThwq3wMdFYq9CjcjKkC |0 http://id.loc.gov/authorities/names/n96062598 | |
| 245 | 1 | 0 | |a Automata theory with modern applications / |c James A. Anderson ; with contributions by Tom Head. |
| 260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2006. | ||
| 300 | |a 1 online resource (viii, 255 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a 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 | |a 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 | |a Print version record. | |
| 650 | 0 | |a Machine theory. |0 http://id.loc.gov/authorities/subjects/sh85079341 | |
| 650 | 0 | |a Formal languages. |0 http://id.loc.gov/authorities/subjects/sh85050802 | |
| 650 | 0 | |a Molecular computers. |0 http://id.loc.gov/authorities/subjects/sh96004522 | |
| 650 | 0 | |a Machine theory |v Problems, exercises, etc. | |
| 650 | 0 | |a Formal languages |v Problems, exercises, etc. | |
| 650 | 0 | |a Molecular computers |v Problems, exercises, etc. | |
| 650 | 6 | |a Théorie des automates. | |
| 650 | 6 | |a Langages formels. | |
| 650 | 6 | |a Ordinateurs moléculaires. | |
| 650 | 6 | |a Théorie des automates |v Problèmes et exercices. | |
| 650 | 6 | |a Langages formels |v Problèmes et exercices. | |
| 650 | 6 | |a Ordinateurs moléculaires |v Problèmes et exercices. | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a Formal languages |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 650 | 7 | |a Molecular computers |2 fast | |
| 655 | 0 | |a Electronic books. | |
| 655 | 7 | |a Problems and exercises |2 fast | |
| 700 | 1 | |a Head, Thomas J., |d 1934- |1 https://id.oclc.org/worldcat/entity/E39PCjwQRTWX4GC8QRHwBkgP6X |0 http://id.loc.gov/authorities/names/no2003068869 | |
| 758 | |i has work: |a Automata theory with modern applications (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGxWP6MJvrDJDBrPPbHP33 |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Anderson, James A. (James Andrew), 1937- |t Automata theory with modern applications. |d Cambridge ; New York : Cambridge University Press, 2006 |z 9780521848879 |w (OCoLC)170025104 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304515 |3 Volltext |
| 887 | |a ProductForm=DG |2 onix | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH13426417 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL268233 | ||
| 938 | |a ebrary |b EBRY |n ebr10131566 | ||
| 938 | |a EBSCOhost |b EBSC |n 304515 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 183642 | ||
| 938 | |a YBP Library Services |b YANK |n 3289320 | ||
| 938 | |a YBP Library Services |b YANK |n 2619753 | ||
| 938 | |a YBP Library Services |b YANK |n 3278538 | ||
| 938 | |a YBP Library Services |b YANK |n 2592308 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn607557660 |
|---|---|
| _version_ | 1816881716156956672 |
| adam_text | |
| any_adam_object | |
| author | Anderson, James A. (James Andrew), 1937- |
| author2 | Head, Thomas J., 1934- |
| author2_role | |
| author2_variant | t j h tj tjh |
| author_GND | http://id.loc.gov/authorities/names/n96062598 http://id.loc.gov/authorities/names/no2003068869 |
| author_facet | Anderson, James A. (James Andrew), 1937- Head, Thomas J., 1934- |
| author_role | |
| author_sort | Anderson, James A. 1937- |
| author_variant | j a a ja jaa |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 .A53 2006eb |
| callnumber-search | QA267 .A53 2006eb |
| callnumber-sort | QA 3267 A53 42006EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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. |
| ctrlnum | (OCoLC)607557660 |
| dewey-full | 511.35 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.35 |
| dewey-search | 511.35 |
| dewey-sort | 3511.35 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06572cam a2200853 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn607557660</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">100416s2006 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLNG</subfield><subfield code="d">NRU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">E7B</subfield><subfield code="d">REDDC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EBLCP</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COO</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LUN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">INTCL</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">171124385</subfield><subfield code="a">171139444</subfield><subfield code="a">647519175</subfield><subfield code="a">668199894</subfield><subfield code="a">741249170</subfield><subfield code="a">815738470</subfield><subfield code="a">819628115</subfield><subfield code="a">847969752</subfield><subfield code="a">1167837396</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511648564</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511648561</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511224354</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511224355</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511225024</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511225024</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511607202</subfield><subfield code="q">(ebook)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511607202</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521848879</subfield><subfield code="q">(hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521848873</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521613248</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521613248</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)607557660</subfield><subfield code="z">(OCoLC)171124385</subfield><subfield code="z">(OCoLC)171139444</subfield><subfield code="z">(OCoLC)647519175</subfield><subfield code="z">(OCoLC)668199894</subfield><subfield code="z">(OCoLC)741249170</subfield><subfield code="z">(OCoLC)815738470</subfield><subfield code="z">(OCoLC)819628115</subfield><subfield code="z">(OCoLC)847969752</subfield><subfield code="z">(OCoLC)1167837396</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267</subfield><subfield code="b">.A53 2006eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.35</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Anderson, James A.</subfield><subfield code="q">(James Andrew),</subfield><subfield code="d">1937-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjKThwq3wMdFYq9CjcjKkC</subfield><subfield code="0">http://id.loc.gov/authorities/names/n96062598</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata theory with modern applications /</subfield><subfield code="c">James A. Anderson ; with contributions by Tom Head.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2006.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (viii, 255 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85079341</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Formal languages.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85050802</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Molecular computers.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh96004522</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory</subfield><subfield code="v">Problems, exercises, etc.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Formal languages</subfield><subfield code="v">Problems, exercises, etc.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Molecular computers</subfield><subfield code="v">Problems, exercises, etc.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des automates.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Langages formels.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Ordinateurs moléculaires.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des automates</subfield><subfield code="v">Problèmes et exercices.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Langages formels</subfield><subfield code="v">Problèmes et exercices.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Ordinateurs moléculaires</subfield><subfield code="v">Problèmes et exercices.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formal languages</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Molecular computers</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="0"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Problems and exercises</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Head, Thomas J.,</subfield><subfield code="d">1934-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjwQRTWX4GC8QRHwBkgP6X</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2003068869</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Automata theory with modern applications (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGxWP6MJvrDJDBrPPbHP33</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Anderson, James A. (James Andrew), 1937-</subfield><subfield code="t">Automata theory with modern applications.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2006</subfield><subfield code="z">9780521848879</subfield><subfield code="w">(OCoLC)170025104</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304515</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="887" ind1=" " ind2=" "><subfield code="a">ProductForm=DG</subfield><subfield code="2">onix</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH13426417</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL268233</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10131566</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">304515</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">183642</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3289320</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2619753</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3278538</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">2592308</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Electronic books. Problems and exercises fast |
| genre_facet | Electronic books. Problems and exercises |
| id | ZDB-4-EBA-ocn607557660 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:07Z |
| institution | BVB |
| isbn | 9780511648564 0511648561 0511224354 9780511224355 0511225024 9780511225024 9780511607202 0511607202 9780521848879 0521848873 9780521613248 0521613248 |
| language | English |
| oclc_num | 607557660 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (viii, 255 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2006 |
| publishDateSearch | 2006 |
| publishDateSort | 2006 |
| publisher | Cambridge University Press, |
| record_format | marc |
| spelling | Anderson, James A. (James Andrew), 1937- https://id.oclc.org/worldcat/entity/E39PCjKThwq3wMdFYq9CjcjKkC http://id.loc.gov/authorities/names/n96062598 Automata theory with modern applications / James A. Anderson ; with contributions by Tom Head. Cambridge ; New York : Cambridge University Press, 2006. 1 online resource (viii, 255 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. 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. 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. Print version record. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Formal languages. http://id.loc.gov/authorities/subjects/sh85050802 Molecular computers. http://id.loc.gov/authorities/subjects/sh96004522 Machine theory Problems, exercises, etc. Formal languages Problems, exercises, etc. Molecular computers Problems, exercises, etc. Théorie des automates. Langages formels. Ordinateurs moléculaires. Théorie des automates Problèmes et exercices. Langages formels Problèmes et exercices. Ordinateurs moléculaires Problèmes et exercices. COMPUTERS Machine Theory. bisacsh Formal languages fast Machine theory fast Molecular computers fast Electronic books. Problems and exercises fast Head, Thomas J., 1934- https://id.oclc.org/worldcat/entity/E39PCjwQRTWX4GC8QRHwBkgP6X http://id.loc.gov/authorities/names/no2003068869 has work: Automata theory with modern applications (Text) https://id.oclc.org/worldcat/entity/E39PCGxWP6MJvrDJDBrPPbHP33 https://id.oclc.org/worldcat/ontology/hasWork Print version: Anderson, James A. (James Andrew), 1937- Automata theory with modern applications. Cambridge ; New York : Cambridge University Press, 2006 9780521848879 (OCoLC)170025104 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304515 Volltext ProductForm=DG onix |
| spellingShingle | Anderson, James A. (James Andrew), 1937- Automata theory with modern applications / 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. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Formal languages. http://id.loc.gov/authorities/subjects/sh85050802 Molecular computers. http://id.loc.gov/authorities/subjects/sh96004522 Machine theory Problems, exercises, etc. Formal languages Problems, exercises, etc. Molecular computers Problems, exercises, etc. Théorie des automates. Langages formels. Ordinateurs moléculaires. Théorie des automates Problèmes et exercices. Langages formels Problèmes et exercices. Ordinateurs moléculaires Problèmes et exercices. COMPUTERS Machine Theory. bisacsh Formal languages fast Machine theory fast Molecular computers fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85079341 http://id.loc.gov/authorities/subjects/sh85050802 http://id.loc.gov/authorities/subjects/sh96004522 |
| title | Automata theory with modern applications / |
| title_auth | Automata theory with modern applications / |
| title_exact_search | Automata theory with modern applications / |
| title_full | Automata theory with modern applications / James A. Anderson ; with contributions by Tom Head. |
| title_fullStr | Automata theory with modern applications / James A. Anderson ; with contributions by Tom Head. |
| title_full_unstemmed | Automata theory with modern applications / James A. Anderson ; with contributions by Tom Head. |
| title_short | Automata theory with modern applications / |
| title_sort | automata theory with modern applications |
| topic | Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Formal languages. http://id.loc.gov/authorities/subjects/sh85050802 Molecular computers. http://id.loc.gov/authorities/subjects/sh96004522 Machine theory Problems, exercises, etc. Formal languages Problems, exercises, etc. Molecular computers Problems, exercises, etc. Théorie des automates. Langages formels. Ordinateurs moléculaires. Théorie des automates Problèmes et exercices. Langages formels Problèmes et exercices. Ordinateurs moléculaires Problèmes et exercices. COMPUTERS Machine Theory. bisacsh Formal languages fast Machine theory fast Molecular computers fast |
| topic_facet | Machine theory. Formal languages. Molecular computers. Machine theory Problems, exercises, etc. Formal languages Problems, exercises, etc. Molecular computers Problems, exercises, etc. Théorie des automates. Langages formels. Ordinateurs moléculaires. Théorie des automates Problèmes et exercices. Langages formels Problèmes et exercices. Ordinateurs moléculaires Problèmes et exercices. COMPUTERS Machine Theory. Formal languages Machine theory Molecular computers Electronic books. Problems and exercises |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304515 |
| work_keys_str_mv | AT andersonjamesa automatatheorywithmodernapplications AT headthomasj automatatheorywithmodernapplications |