Automata theory and formal languages:
The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explana...
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Berlin ; Boston
De Gruyter
[2022]
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033292438&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Zusammenfassung: | The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students |
| Umfang: | XIII, 231 Seiten |
| ISBN: | 9783110752274 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV047910674 | ||
| 003 | DE-604 | ||
| 005 | 20240529 | ||
| 007 | t| | ||
| 008 | 220404s2022 xx |||| 00||| eng d | ||
| 016 | 7 | |a 1246960389 |2 DE-101 | |
| 020 | |a 9783110752274 |c paperback |9 978-3-11-075227-4 | ||
| 035 | |a (OCoLC)1287932909 | ||
| 035 | |a (DE-599)BVBBV047910674 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 |a DE-29T |a DE-473 |a DE-739 |a DE-703 | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Homenda, Władysław |e Verfasser |0 (DE-588)1245413953 |4 aut | |
| 245 | 1 | 0 | |a Automata theory and formal languages |c Wladyslaw Homenda, Witold Pedrycz |
| 264 | 1 | |a Berlin ; Boston |b De Gruyter |c [2022] | |
| 264 | 4 | |c © 2022 | |
| 300 | |a XIII, 231 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students | ||
| 650 | 4 | |a Automaten | |
| 650 | 4 | |a Digitale Systeme | |
| 650 | 4 | |a Formale Sprachen | |
| 650 | 4 | |a Turing Maschinen | |
| 650 | 7 | |a COMPUTERS / Information Theory |2 bisacsh | |
| 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 Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Pedrycz, Witold |d 1953- |e Verfasser |0 (DE-588)122838203 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe, PDF |z 978-3-11-075230-4 |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe, EPUB |z 978-3-11-075231-1 |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033292438&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-033292438 | |
Datensatz im Suchindex
| _version_ | 1819338910448222208 |
|---|---|
| adam_text | CONTENTS
FOREWORD
-
V
PREFACE
-
VII
1
PRELIMINARIES
-
1
1.1
SETS
-
1
1.2
RELATIONS
----
3
1.2.1
MULTIPLACE
RELATIONS
-
3
1.2.2
TWO
PLACE
RELATIONS
-
4
1.2.3
BINARY
RELATIONS
-
6
1.2.4
EQUIVALENCE
RELATIONS
-
7
1.2.5
CLOSURE
OF
RELATIONS
-
7
1.3
MATHEMATICAL
INDUCTION
-
9
1.4
GRAPHS
AND
TREES
-
10
1.4.1
GRAPHS
-
11
1.4.2
TREES
-
11
1.5
LANGUAGES
-
13
1.5.1
BASIC
DEFINITIONS
----
13
1.5.2
OPERATIONS
ON
LANGUAGES
-
14
1.6
GRAMMARS
-
17
1.7
PROBLEMS
-
19
PART
I:
GRAMMARS
AND
GENERATING
LANGUAGES
2
REGULAR
EXPRESSIONS
AND
REGULAR
LANGUAGES
-
25
2.1
REGULAR
EXPRESSIONS
AND
REGULAR
LANGUAGES
-
25
2.1.1
REGULAR
EXPRESSIONS
-
25
2.1.2
REGULAR
LANGUAGES
-
27
2.1.3
THE
MYHILL-NERODE
LEMMA
-
29
2.1.4
THE
PUMPING
LEMMA
-
30
2.1.5
REGULAR
GRAMMARS
-
32
2.2
PROBLEMS
-----
35
3
CONTEXT-FREE
GRAM
MARS
-
37
3.1
CONTEXT-FREE
GRAMMARS
-
BASICS
-
37
3.2
SIMPLIFICATION
OF
CONTEXT-FREE
GRAMMARS
-
42
3.2.1
USELESS
SYMBOLS
-
42
3.2.2
NULLABLE
SYMBOLS
AND
-PRODUCTIONS
-
45
3.2.3
UNIT
PRODUCTIONS
-
48
XII
-
-
CONTENTS
3.3
3.3.1
3.3.2
3.4
3.4.1
3.4.2
3.5
3.6
3.6.1
3.6.2
3.7
NORMAL
FORMS
OF
CONTEXT-FREE
GRAMMARS
-
50
CHOMSKY
NORMAL
FORM
-
50
GREIBACH
NORMAL
FORM
-
53
PUMPING
AND
OGDEN
LEMMAS
----
57
THE
PUMPING
LEMMA
-
57
THE
OGDEN
LEMMA
-
61
CONTEXT-FREE
LANGUAGE
MEMBERSHIP
-
63
APPLICATIONS
-
69
TRANSLATION
GRAMMARS
-
69
LL(1)
GRAMMARS
-
70
PROBLEMS
-
76
4
4.1
4.2
CONTEXT-SENSITIVE
GRAMMARS
AND
UNRESTRICTED
GRAMMARS
-
81
CONTEXT-SENSITIVE
GRAMMARS
-
81
UNRESTRICTED
GRAMMARS
-
87
PART
II:
AUTOMATA
AND
ACCEPTING
LANGUAGES
5
5.1
5.1.1
5.1.2
5.1.3
5.1.4
5.1.5
5.1.6
5.1.7
5.1.8
5.2
5.3
5.4
TURING
MACHINES
-
93
DETERMINISTIC
TURING
MACHINES
-
93
BASIC
MODEL
OF
TURING
MACHINES
-
94
TURING
MACHINE
WITH
THE
STOP
PROPERTY
-
100
SIMPLIFYING
THE
STOP
CONDITION
-
102
GUARDING
THE
TAPE
BEGINNING
-
103
TURING
MACHINES
WITH
A
MULTITRACK
TAPE
----
106
TURING
MACHINES
WITH
TWO-WAY
INFINITE
TAPE
-
108
MULTITAPE
TURING
MACHINES
-
111
PROGRAMMING
WITH
TURING
MACHINES
-
117
NONDETERMINISTIC
TURING
MACHINES
-
122
LINEAR
BOUNDED
AUTOMATA
-
130
PROBLEMS
-
134
6
6.1
6.2
6.3
6.4
6.5
PUSHDOWN
AUTOMATA
-
139
NONDETERMINISTIC
PUSHDOWN
AUTOMATA
-
139
DETERMINISTIC
PUSHDOWN
AUTOMATA
-
145
ACCEPTING
STATES
VERSUS
EMPTY
STACK
-
148
PUSHDOWN
AUTOMATA
AS
TURING
MACHINES
-
150
PROBLEMS
-
152
7
7.1
FINITE
AUTOMATA
-
156
DETERMINISTIC
FINITE
AUTOMATA
-
156
CONTENTS
-
XIII
7.2
NONDETERMINISTIC
FINITE
AUTOMATA
-
162
7.3
FINITE
AUTOMATA
WITH
E-TRANSITIONS
-
171
7.4
FINITE
AUTOMATA
AS
TURING
MACHINES
-
180
7.5
PROBLEMS
-
182
PART
III:
REVISITED:
LANGUAGES,
GRAMMARS,
AUTOMATA
8
GRAMMARS
VERSUS
AUTOMATA
-
187
8.1
REGULAR
EXPRESSIONS,
REGULAR
GRAMMARS
AND
FINITE
AUTOMATA
-
187
8.1.1
REGULAR
EXPRESSIONS
VERSUS
FINITE
AUTOMATA
-
187
8.1.2
REGULAR
GRAMMARS
VERSUS
FINITE
AUTOMATA
-
193
8.1.3
THE
PUMPING
LEMMA
-
197
8.1.4
THE
MYHILL-NERODE
THEOREM
-
199
8.1.5
MINIMIZATION
OF
DETERMINISTIC
FINITE
AUTOMATA
-
200
8.2
MORE
GRAMMARS
AND
AUTOMATA
-
201
8.2.1
CONTEXT-FREE
GRAMMARS
VERSUS
PUSHDOWN
AUTOMATA
-
201
8.2.2
UNRESTRICTED
GRAMMARS
VERSUS
TURING
MACHINES
-
205
8.2.3
CONTEXT-SENSITIVE
GRAMMARS
VERSUS
LINEAR
BOUNDED
AUTOMATA
-
207
9
AROUND
THE
HIERARCHY
OF
LANGUAGES
-
208
9.1
MORE
OPERATIONS
ON
LANGUAGES
-
208
9.1.1
SUBSTITUTIONS,
HOMOMORPHISMS
-
208
9.1.2
QUOTIENTS
----
211
9.1.3
BUILDING
AUTOMATA
WITH
QUOTIENTS
-
212
9.2
CLOSURE
----
214
9.3
THE
HIERARCHY
OF
LANGUAGES
-
219
BIBLIOGRAPHY
-
227
INDEX
-
229
|
| any_adam_object | 1 |
| author | Homenda, Władysław Pedrycz, Witold 1953- |
| author_GND | (DE-588)1245413953 (DE-588)122838203 |
| author_facet | Homenda, Władysław Pedrycz, Witold 1953- |
| author_role | aut aut |
| author_sort | Homenda, Władysław |
| author_variant | w h wh w p wp |
| building | Verbundindex |
| bvnumber | BV047910674 |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)1287932909 (DE-599)BVBBV047910674 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02269nam a2200469 c 4500</leader><controlfield tag="001">BV047910674</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240529 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">220404s2022 xx |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1246960389</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110752274</subfield><subfield code="c">paperback</subfield><subfield code="9">978-3-11-075227-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1287932909</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047910674</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-11</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</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">Homenda, Władysław</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1245413953</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata theory and formal languages</subfield><subfield code="c">Wladyslaw Homenda, Witold Pedrycz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Boston</subfield><subfield code="b">De Gruyter</subfield><subfield code="c">[2022]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 231 Seiten</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="520" ind1=" " ind2=" "><subfield code="a">The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automaten</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Digitale Systeme</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formale Sprachen</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing Maschinen</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Information Theory</subfield><subfield code="2">bisacsh</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pedrycz, Witold</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122838203</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe, PDF</subfield><subfield code="z">978-3-11-075230-4</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe, EPUB</subfield><subfield code="z">978-3-11-075231-1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=033292438&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033292438</subfield></datafield></record></collection> |
| id | DE-604.BV047910674 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T19:32:00Z |
| institution | BVB |
| isbn | 9783110752274 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033292438 |
| oclc_num | 1287932909 |
| open_access_boolean | |
| owner | DE-11 DE-29T DE-473 DE-BY-UBG DE-739 DE-703 |
| owner_facet | DE-11 DE-29T DE-473 DE-BY-UBG DE-739 DE-703 |
| physical | XIII, 231 Seiten |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | De Gruyter |
| record_format | marc |
| spellingShingle | Homenda, Władysław Pedrycz, Witold 1953- Automata theory and formal languages Automaten Digitale Systeme Formale Sprachen Turing Maschinen COMPUTERS / Information Theory bisacsh Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 |
| title | Automata theory and formal languages |
| title_auth | Automata theory and formal languages |
| title_exact_search | Automata theory and formal languages |
| title_full | Automata theory and formal languages Wladyslaw Homenda, Witold Pedrycz |
| title_fullStr | Automata theory and formal languages Wladyslaw Homenda, Witold Pedrycz |
| title_full_unstemmed | Automata theory and formal languages Wladyslaw Homenda, Witold Pedrycz |
| title_short | Automata theory and formal languages |
| title_sort | automata theory and formal languages |
| topic | Automaten Digitale Systeme Formale Sprachen Turing Maschinen COMPUTERS / Information Theory bisacsh Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Automaten Digitale Systeme Formale Sprachen Turing Maschinen COMPUTERS / Information Theory Automatentheorie Formale Sprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=033292438&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT homendawładysław automatatheoryandformallanguages AT pedryczwitold automatatheoryandformallanguages |