Elements of automata theory:
Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2009
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xxiv, 758 pages) |
| ISBN: | 9781139195218 |
| DOI: | 10.1017/CBO9781139195218 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043945228 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2009 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139195218 |c Online |9 978-1-139-19521-8 | ||
| 024 | 7 | |a 10.1017/CBO9781139195218 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139195218 | ||
| 035 | |a (OCoLC)880839459 | ||
| 035 | |a (DE-599)BVBBV043945228 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 512 |2 22 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Sakarovitch, Jacques |e Verfasser |4 aut | |
| 240 | 1 | 0 | |a Eléments de théorie des automates |
| 245 | 1 | 0 | |a Elements of automata theory |c Jacques Sakarovitch ; translated by Reuben Thomas |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2009 | |
| 300 | |a 1 online resource (xxiv, 758 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers | |
| 520 | |a Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book | ||
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Thomas, Reuben |4 trl | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-84425-3 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139195218 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029354198 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139195218 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139195218 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176891221901312 |
|---|---|
| any_adam_object | |
| author | Sakarovitch, Jacques |
| author2 | Thomas, Reuben |
| author2_role | trl |
| author2_variant | r t rt |
| author_facet | Sakarovitch, Jacques Thomas, Reuben |
| author_role | aut |
| author_sort | Sakarovitch, Jacques |
| author_variant | j s js |
| building | Verbundindex |
| bvnumber | BV043945228 |
| classification_rvk | ST 136 |
| collection | ZDB-20-CBO |
| contents | Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers |
| ctrlnum | (ZDB-20-CBO)CR9781139195218 (OCoLC)880839459 (DE-599)BVBBV043945228 |
| dewey-full | 512 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512 |
| dewey-search | 512 |
| dewey-sort | 3512 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/CBO9781139195218 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02884nmm a2200481zc 4500</leader><controlfield tag="001">BV043945228</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2009 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139195218</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-19521-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139195218</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139195218</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)880839459</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043945228</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sakarovitch, Jacques</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Eléments de théorie des automates</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of automata theory</subfield><subfield code="c">Jacques Sakarovitch ; translated by Reuben Thomas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxiv, 758 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thomas, Reuben</subfield><subfield code="4">trl</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-84425-3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139195218</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029354198</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139195218</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139195218</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043945228 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:23Z |
| institution | BVB |
| isbn | 9781139195218 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029354198 |
| oclc_num | 880839459 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xxiv, 758 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Sakarovitch, Jacques Verfasser aut Eléments de théorie des automates Elements of automata theory Jacques Sakarovitch ; translated by Reuben Thomas Cambridge Cambridge University Press 2009 1 online resource (xxiv, 758 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 05 Oct 2015) Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book Machine theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s 1\p DE-604 Thomas, Reuben trl Erscheint auch als Druckausgabe 978-0-521-84425-3 https://doi.org/10.1017/CBO9781139195218 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Sakarovitch, Jacques Elements of automata theory Preface to the English edition -- Preface -- Fundamental structures -- The simplest possible machine -- The power of algebra -- The pertinence of enumeration -- The richness of transducers -- The simplicity of functional transducers Machine theory Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4003953-5 |
| title | Elements of automata theory |
| title_alt | Eléments de théorie des automates |
| title_auth | Elements of automata theory |
| title_exact_search | Elements of automata theory |
| title_full | Elements of automata theory Jacques Sakarovitch ; translated by Reuben Thomas |
| title_fullStr | Elements of automata theory Jacques Sakarovitch ; translated by Reuben Thomas |
| title_full_unstemmed | Elements of automata theory Jacques Sakarovitch ; translated by Reuben Thomas |
| title_short | Elements of automata theory |
| title_sort | elements of automata theory |
| topic | Machine theory Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | Machine theory Automatentheorie |
| url | https://doi.org/10.1017/CBO9781139195218 |
| work_keys_str_mv | AT sakarovitchjacques elementsdetheoriedesautomates AT thomasreuben elementsdetheoriedesautomates AT sakarovitchjacques elementsofautomatatheory AT thomasreuben elementsofautomatatheory |