A second course in formal languages and automata theory:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2009
|
| Ausgabe: | 1. publ. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 240 S. graph. Darst. |
| ISBN: | 9780521865722 |
Internformat
MARC
| LEADER | 00000nam a22000002c 4500 | ||
|---|---|---|---|
| 001 | BV035133220 | ||
| 003 | DE-604 | ||
| 005 | 20090227 | ||
| 007 | t | ||
| 008 | 081031s2009 d||| |||| 00||| eng d | ||
| 020 | |a 9780521865722 |c (hbk.) : £30.00 hbk. : £30.00 : CIP entry (Nov.) |9 978-0-521-86572-2 | ||
| 035 | |a (OCoLC)231581066 | ||
| 035 | |a (DE-599)BSZ286185989 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-29T |a DE-473 |a DE-19 | ||
| 050 | 0 | |a QA267.3 | |
| 082 | 0 | |a 005.13/1 |2 22 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Shallit, Jeffrey O. |d 1957- |e Verfasser |0 (DE-588)128576502 |4 aut | |
| 245 | 1 | 0 | |a A second course in formal languages and automata theory |c Jeffrey Shallit |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2009 | |
| 300 | |a XI, 240 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016800706&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016800706 | ||
Datensatz im Suchindex
| _version_ | 1804138116097769472 |
|---|---|
| adam_text | Contents
Preface
page
ix
1
Review of formal languages and automata theory
1
1.1
Sets
1
1.2
Symbols, strings, and languages
1
1.3
Regular expressions and regular languages
3
1.4
Finite automata
4
1.5
Context-free grammars and languages
8
1.6
Turing machines
13
1.7
Unsolvability
17
1.8
Complexity theory
19
1.9
Exercises
21
1.10
Projects
26
1.11
Research problems
26
1.12
Notes on Chapter
1 26
28
28
29
30
34
37
40
43
47
47
2.10
Notes on Chapter
2 47
2
Combinatorics on words
2.1
Basics
2.2
Morphisms
2.3
The theorems of
Lyndon-Schützenberger
2.4
Conjugates and borders
2.5
Repetitions in strings
2.6
Applications of the Thue-Morse sequence
and squarefree strings
2.7
Exercises
2.8
Projects
2.9
Research problems
vi
Contents
3
Finite
automata and regular
languages
49
3.1
Moore and Mealy machines
49
3.2
Quotients
52
3.3
Morphisms and substitutions
54
3.4
Advanced closure properties of regular languages
58
3.5
Transducers
61
3.6
Two-way finite automata
65
3.7
The transformation automaton
71
3.8
Automata, graphs, and Boolean matrices
73
3.9
The Myhill-Nerode theorem
77
3.10
Minimization of finite automata
81
3.11
State complexity
89
3.12
Partial orders and regular languages
92
3.13
Exercises
95
3.14
Projects
105
3.15
Research problems
105
3.16
Notes on Chapter
3 106
4
Context-free grammars and languages
108
4.1
Closure properties
108
4.2
Unary context-free languages 111
4.3
Ogden s lemma
112
4.4
Applications of Ogden s lemma
114
4.5
The interchange lemma
118
4.6
Parikh s theorem
121
4.7
Deterministic context-free languages
126
4.8
Linear languages
130
4.9
Exercises
132
4.10
Projects
138
4.11
Research problems
138
4.12
Notes on Chapter
4 138
5
Parsing and recognition
140
5.1
Recognition and parsing in general grammars
141
5.2
Earley s method
144
5.3
Top-down parsing
152
5.4
Removing LLCl) conflicts
161
5.5
Bottom-up parsing
163
5.6
Exercises
172
5.7
Projects
173
5.8
Notes on Chapter
5 173
6
Turing machines
6.1
Unrestricted grammars
6.2
Kolmogorov complexity
6.3
The incompressibility method
6.4
The busy beaver problem
6.5
The Post correspondence problem
6.6
Unsolvability and context-free languages
6.7
Complexity and regular languages
6.8
Exercises
6.9
Projects
6.10
Research problems
6.11
Notes on Chapter
6
7
Other language classes
7.1
Context-sensitive languages
7.2
The Chomsky hierarchy
7.3
2DPDAs and Cook s theorem
7.4
Exercises
7.5
Projects
7.6
Research problems
7.7
Notes on Chapter
7
Bibliography
Index
Contents
vii
174
174
177
180
183
186
190
193
198
200
200
200
202
202
212
213
221
222
222
223
225
233
|
| adam_txt |
Contents
Preface
page
ix
1
Review of formal languages and automata theory
1
1.1
Sets
1
1.2
Symbols, strings, and languages
1
1.3
Regular expressions and regular languages
3
1.4
Finite automata
4
1.5
Context-free grammars and languages
8
1.6
Turing machines
13
1.7
Unsolvability
17
1.8
Complexity theory
19
1.9
Exercises
21
1.10
Projects
26
1.11
Research problems
26
1.12
Notes on Chapter
1 26
28
28
29
30
34
37
40
43
47
47
2.10
Notes on Chapter
2 47
2
Combinatorics on words
2.1
Basics
2.2
Morphisms
2.3
The theorems of
Lyndon-Schützenberger
2.4
Conjugates and borders
2.5
Repetitions in strings
2.6
Applications of the Thue-Morse sequence
and squarefree strings
2.7
Exercises
2.8
Projects
2.9
Research problems
vi
Contents
3
Finite
automata and regular
languages
49
3.1
Moore and Mealy machines
49
3.2
Quotients
52
3.3
Morphisms and substitutions
54
3.4
Advanced closure properties of regular languages
58
3.5
Transducers
61
3.6
Two-way finite automata
65
3.7
The transformation automaton
71
3.8
Automata, graphs, and Boolean matrices
73
3.9
The Myhill-Nerode theorem
77
3.10
Minimization of finite automata
81
3.11
State complexity
89
3.12
Partial orders and regular languages
92
3.13
Exercises
95
3.14
Projects
105
3.15
Research problems
105
3.16
Notes on Chapter
3 106
4
Context-free grammars and languages
108
4.1
Closure properties
108
4.2
Unary context-free languages 111
4.3
Ogden's lemma
112
4.4
Applications of Ogden's lemma
114
4.5
The interchange lemma
118
4.6
Parikh's theorem
121
4.7
Deterministic context-free languages
126
4.8
Linear languages
130
4.9
Exercises
132
4.10
Projects
138
4.11
Research problems
138
4.12
Notes on Chapter
4 138
5
Parsing and recognition
140
5.1
Recognition and parsing in general grammars
141
5.2
Earley's method
144
5.3
Top-down parsing
152
5.4
Removing LLCl) conflicts
161
5.5
Bottom-up parsing
163
5.6
Exercises
172
5.7
Projects
173
5.8
Notes on Chapter
5 173
6
Turing machines
6.1
Unrestricted grammars
6.2
Kolmogorov complexity
6.3
The incompressibility method
6.4
The busy beaver problem
6.5
The Post correspondence problem
6.6
Unsolvability and context-free languages
6.7
Complexity and regular languages
6.8
Exercises
6.9
Projects
6.10
Research problems
6.11
Notes on Chapter
6
7
Other language classes
7.1
Context-sensitive languages
7.2
The Chomsky hierarchy
7.3
2DPDAs and Cook's theorem
7.4
Exercises
7.5
Projects
7.6
Research problems
7.7
Notes on Chapter
7
Bibliography
Index
Contents
vii
174
174
177
180
183
186
190
193
198
200
200
200
202
202
212
213
221
222
222
223
225
233 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Shallit, Jeffrey O. 1957- |
| author_GND | (DE-588)128576502 |
| author_facet | Shallit, Jeffrey O. 1957- |
| author_role | aut |
| author_sort | Shallit, Jeffrey O. 1957- |
| author_variant | j o s jo jos |
| building | Verbundindex |
| bvnumber | BV035133220 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.3 |
| callnumber-search | QA267.3 |
| callnumber-sort | QA 3267.3 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)231581066 (DE-599)BSZ286185989 |
| dewey-full | 005.13/1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/1 |
| dewey-search | 005.13/1 |
| dewey-sort | 15.13 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01553nam a22003972c 4500</leader><controlfield tag="001">BV035133220</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090227 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081031s2009 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521865722</subfield><subfield code="c">(hbk.) : £30.00 hbk. : £30.00 : CIP entry (Nov.)</subfield><subfield code="9">978-0-521-86572-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231581066</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ286185989</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.3</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/1</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">Shallit, Jeffrey O.</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)128576502</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A second course in formal languages and automata theory</subfield><subfield code="c">Jeffrey Shallit</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 240 S.</subfield><subfield code="b">graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</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="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016800706&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016800706</subfield></datafield></record></collection> |
| id | DE-604.BV035133220 |
| illustrated | Illustrated |
| index_date | 2024-07-02T22:25:09Z |
| indexdate | 2024-07-09T21:23:04Z |
| institution | BVB |
| isbn | 9780521865722 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016800706 |
| oclc_num | 231581066 |
| open_access_boolean | |
| owner | DE-20 DE-29T DE-473 DE-BY-UBG DE-19 DE-BY-UBM |
| owner_facet | DE-20 DE-29T DE-473 DE-BY-UBG DE-19 DE-BY-UBM |
| physical | XI, 240 S. graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Shallit, Jeffrey O. 1957- Verfasser (DE-588)128576502 aut A second course in formal languages and automata theory Jeffrey Shallit 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2009 XI, 240 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Formal languages Machine theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Formale Sprache (DE-588)4017848-1 s Automatentheorie (DE-588)4003953-5 s DE-604 Digitalisierung UB Bamberg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016800706&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Shallit, Jeffrey O. 1957- A second course in formal languages and automata theory Formal languages Machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 |
| title | A second course in formal languages and automata theory |
| title_auth | A second course in formal languages and automata theory |
| title_exact_search | A second course in formal languages and automata theory |
| title_exact_search_txtP | A second course in formal languages and automata theory |
| title_full | A second course in formal languages and automata theory Jeffrey Shallit |
| title_fullStr | A second course in formal languages and automata theory Jeffrey Shallit |
| title_full_unstemmed | A second course in formal languages and automata theory Jeffrey Shallit |
| title_short | A second course in formal languages and automata theory |
| title_sort | a second course in formal languages and automata theory |
| topic | Formal languages Machine theory Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Formal languages Machine theory Automatentheorie Formale Sprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016800706&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT shallitjeffreyo asecondcourseinformallanguagesandautomatatheory |