Formal languages and computation: models and their applications
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boca Raton [u.a.]
CRC Press
2014
|
| Series: | An Auerbach book
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis Inhaltsverzeichnis |
| Item Description: | Includes bibliographical references and index |
| Physical Description: | XIX, 295 S. |
| ISBN: | 9781466513457 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041795184 | ||
| 003 | DE-604 | ||
| 005 | 20161219 | ||
| 007 | t | ||
| 008 | 140414s2014 |||| 00||| eng d | ||
| 010 | |a 2013025935 | ||
| 020 | |a 9781466513457 |c hbk |9 978-1-4665-1345-7 | ||
| 035 | |a (OCoLC)881857882 | ||
| 035 | |a (DE-599)GBV755615360 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-83 |a DE-703 | ||
| 082 | 0 | |a 005.131 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 100 | 1 | |a Meduna, Alexander |d 1957- |e Verfasser |0 (DE-588)120675617 |4 aut | |
| 245 | 1 | 0 | |a Formal languages and computation |b models and their applications |c Alexander Meduna |
| 264 | 1 | |a Boca Raton [u.a.] |b CRC Press |c 2014 | |
| 300 | |a XIX, 295 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a An Auerbach book | |
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | 2 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | |m DE-601 |q pdf/application |u http://www.gbv.de/dms/bowker/toc/9781466513457.pdf |3 Inhaltsverzeichnis | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027240716&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027240716 | ||
Record in the Search Index
| _version_ | 1804152113844977664 |
|---|---|
| adam_text | Contents
Preface
.....................................................................................................................................xiii
Acknowledgments
....................................................................................................................xvii
Author
......................................................................................................................................xix
SECTION I INTRODUCTION
1
Mathematical Background
...........................................................................................3
1.1
Logic
.......................................................................................................................3
1.2
Sets and Sequences
..................................................................................................4
1.3
Relations
..................................................................................................................6
1.4
Graphs
.....................................................................................................................7
2
Formal Languages and Rewriting Systems
.................................................................13
2.1
Formal Languages
..................................................................................................13
2.2
Rewriting Systems
..................................................................................................15
2.2.1
Rewriting Systems in General
....................................................................16
2.2.2
Rewriting Systems as Language Models
....................................................17
2.2.3
Rewriting Systems as Computational Models
............................................21
2.3
Synopsis of the Book
..............................................................................................25
SECTION II REGULAR LANGUAGES AND THEIR MODELS
3
Models for Regular Languages
...................................................................................31
3.1
Finite Automata
......................................................................................................31
3.1.1
Representations of Finite Automata
..........................................................32
3.2
Restricted Finite Automata
....................................................................................34
3.2.1
Removal of
ε
-Rules...................................................................................
34
3.2.2
Determinism
............................................................................................38
3.2.2.1
Complete Specification
.............................................................42
3.2.3
Minimization
...........................................................................................43
3.3
Regular Expressions and Their Equivalence with Finite Automata
.........................45
3.3.1
Regular Expressions
...................................................................................45
3.3.2
Equivalence with Finite Automata
.............................................................47
3.3.2.1
From Finite Automata to Regular Expressions
...........................47
3.3.2.2
From Regular Expressions to Finite Automata
..........................49
vii
viii
■ Contents
4
Applications of Regular Expressions and Finite Automata:
Lexical Analysis
..........................................................................................................61
4.1 Implementation
ol
l;in
ite
Лін
ornai.
ι
.......................................................................62
4.1.1
Table-
Ka
seil
Implementation
....................................................................62
4.1.2 (
^a.se-St
л
lenient Implementation
...............................................................64
4.2
Introduction to Lexical Analysis
............................................................................66
4.2.1 1
.ex it a I I mils and Regular Expressions
.....................................................66
4.2.2
Sea
η
nei.
s
aiul lin
it
e
Automata
..................................................................66
4.3
Implement
al ion
o( a Scanner
..................................................................................67
5
Properties of Regular Languages
...............................................................................73
S.
)
Pumping
1
emina
lor Regular Languages
..............................................................73
S.I.I Applications o( the Pumping Lemma lor Regular Languages
...................75
5.2
Closure Properties
.................................................................................................77
5.2.
1 Applications
oí
Closure
Properlies
............................................................80
SECTION III CONTEXT-FREE LANGUAGES AND THEIR MODELS
6
Models for Context-Free Languages
...........................................................................85
6.1
Conrext-Free Grammars
.........................................................................................85
6.2
Restricted Context-Free Grammars
.......................................................................89
6.2.1
Canonical Derivations and Derivation Trees
............................................90
6.2.1.1
Leftmost Derivations
................................................................90
6.2.1.2
Rightmost Derivations
.............................................................92
6.2.1.3
Derivation Trees
.......................................................·...............92
6.2.1.4
Ambiguity
................................................................................94
6.2.2
Removal of Useless Symbols
.....................................................................96
6.2.3
Removal of Erasing Rules
.........................................................................99
6.2.4
Removal of Single Rules
..........................................................................103
6.2.5
Chomsky Normal Form
..........................................................................104
6.2.6
Elimination of Left Recursion
.................................................................106
6.2.7
Greibach Normal Form
...........................................................................110
6.3
Pushdown Automata
............................................................................................113
6.3.1
Pushdown Automata and Their Languages
..............................................113
6.3.2
Equivalence with Context-Free Grammars
..............................................114
6.3.2.1
From Context-Free Grammars to
Pushdown Automata
...............................................................114
6.3.2.2
From Pushdown Automata to Context-Free Grammars
...........115
6.3.3
Equivalent Types of Acceptance
..............................................................119
6.3.4
Deterministic Pushdown Automata
.........................................................121
7
Applications of Models for Context-Free Languages:
Syntax Analysis
........................................................................................................131
7.1
Introduction to Syntax Analysis
............................................................................132
7.1.1
Syntax Specified by Context-Free Grammars
...........................................133
7.1.2
Top-Down Parsing
................................................................................. 134
7.1.3
Bottom-Up Parsing
................................................................................. 136
Contents ■ ix
7.2
Top-Down Parsing
...............................................................................................
I4l
7.2.1
Predictive Sets and LL Grammars
...........................................................142
7.2.1.1
LL Grammars
..........................................................................145
7.2.2
Predictive Parsing
....................................................................................146
7.2.2.1
Predictive Recursive-Descent Parsing
......................................146
7.2.2.2
Predictive Table-Driven Parsing
...............................................149
7.2.2.3
Handling Errors
......................................................................153
7.2.2.4
Exclusion of Left Recursion
.....................................................154
7-3
Bottom-Up Parsing
...............................................................................................155
7.3.1
Operator-Precedence Parsing
...................................................................155
7.3.1.1
Operator-Precedence Parser
.....................................................156
7.3.1.2
Construction of Operator-Precedence Parsing
Table
........................................................................................158
7.3.1.3
Handling Errors
......................................................................159
7.3.1.4
Operator-Precedence Parsers for Other
Expressions
..............................................................................162
7.3.2
LR Parsing
...............................................................................................163
7.3.2.
Î
LR Parsing Algorithm
..............................................................164
7.3.2.2
Construction of LR Table
........................................................167
7 .3.2.3
Handling Errors in LR Parsing
................................................173
8
Properties of Context-Free Languages
.....................................................................187
8.1
Pumping Lemma for Context-Free Languages
.....................................................187
8.1.1
Applications of the Pumping Lemma
......................................................189
8.2
Closure Properties
................................................................................................189
8.2.1
Union, Concatenation, and Closure
........................................................190
8.2.2
Intersection and Complement
..................................................................190
8.2.3
Homomorphism
......................................................................................192
8.2.4
Applications of the Closure Properties
.....................................................192
SECTION IV TURING MACHINES AND COMPUTATION
9
Turing Machines and Their Variants
........................................................................199
9.1
Turing Machines and Their Languages
.................................................................199
9.2
Restricted Turing Machines
................................................................................202
9.2.1
Computational Restrictions
....................................................................203
9.2.2
Size Restrictions
.....................................................................................205
9.3
Universal Turing Machines
.................................................................................206
9.3.1
Turing Machine Codes
...........................................................................206
9.3.2
Construction of Universal Turing Machines
...........................................208
10
Applications of Turing Machines: Theory of Computation
.....................................213
10.1
Computability
......................................................................................................214
10.1.1
Integer Functions Computed by Turing
Machines
.................................................................................................214
10.1.2
Recursion Theorem
..................................................................................217
10.1.3
Kleene s s-m-n Theorem
...........................................................................219
χ
■ Contents
10.2
Decidability
.........................................................................................................220
10.2.1
Turing Deciders
......................................................................................220
10.2.2
Decidable Problems
................................................................................223
10.2.2.1
Decidable Problems for Finite Automata
................................223
10.2.2.2
Decidable Problems for Context-Free Grammars
....................225
1 0.2.3
Undecidable Problems
............................................................................227
10.2.3.1
Diagonalization
......................................................................228
10.2.3.2
Reduction
...............................................................................230
10.2.3.3
Undecidable Problems
Nol
Concerning
Fining Machines
.....................................................................233
10.2.4
General Approach to Undecidability
......................................................234
10.2.4.1
Rice s theorem
.......................................................................237
1 0.2.5
Computational Complexity
....................................................................238
10.2.5.1
Time Complexity
...................................................................238
10.2.5.2
Space Complexity
...................................................................240
11
Turing Machines and General Grammars
................................................................245
11.1
General Grammars and Their Equivalence with Turing
Machines
..............................................................................................................245
11.1.1
General Grammars
..................................................................................245
11.1.2
Normal Forms
........................................................................................246
1 1.1.3
Equivalence of General Grammars and Turing Machines
......................248
11.1.3.1
From General Grammars to Turing Machines
........................248
11.1.3.2
From Turing Machines to General Grammars
.........................249
11.2
Context-Sensitive Grammars and Linear-Bounded Automata
..............................250
1 1.2.1
Context-Sensitive Grammars and Their Normal Forms
...........................250
11.2.1.1
Normal Forms
.........................................................................251
11.2.2
Linear-Bounded Automata and Their Equivalence with
Context-Sensitive Grammars
...................................................................251
11.2.2.1
From Context-Sensitive Grammars to Linear-Bounded
Automata
.................................................................................251
11.2.2.2
From Linear-Bounded Automata to Context-Sensitive
Grammars
...............................................................................252
11.2.3
Context-Sensitive Languages and Decidable Languages
..........................253
11.3
Relations between Language Families
.................................................................254
SECTION V CONCLUSION
12
Concluding and Bibliographical Remarks
...............................................................261
12.1
Summary
..............................................................................................................261
12.2
Modern Trends
....................................................................................................263
12.2.1
Conditional Grammars
..........................................................................263
12.2.2
Regulated Grammars
..............................................................................263
12.2.3
Scattered Context Grammars
.................................................................264
12.2.4
Grammar Systems
..................................................................................264
12.3
Bibliographical and Historical Remarks
..............................................................264
Contents ■ xi
Appendix
I:
Index
to
Special Symbols...............................................................................269
Appendix
II:
Index
to Language
Models...........................................................................271
References.........................................................................................................................
273
Bibliography
......................................................................................................................279
Index.................................................................................................................................289
|
| any_adam_object | 1 |
| author | Meduna, Alexander 1957- |
| author_GND | (DE-588)120675617 |
| author_facet | Meduna, Alexander 1957- |
| author_role | aut |
| author_sort | Meduna, Alexander 1957- |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV041795184 |
| classification_rvk | ST 136 ST 230 |
| ctrlnum | (OCoLC)881857882 (DE-599)GBV755615360 |
| dewey-full | 005.131 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.131 |
| dewey-search | 005.131 |
| dewey-sort | 15.131 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01798nam a2200433 c 4500</leader><controlfield tag="001">BV041795184</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20161219 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140414s2014 |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2013025935</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781466513457</subfield><subfield code="c">hbk</subfield><subfield code="9">978-1-4665-1345-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)881857882</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV755615360</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-703</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</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="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meduna, Alexander</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120675617</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal languages and computation</subfield><subfield code="b">models and their applications</subfield><subfield code="c">Alexander Meduna</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton [u.a.]</subfield><subfield code="b">CRC Press</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 295 S.</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="490" ind1="0" ind2=" "><subfield code="a">An Auerbach book</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</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="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</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">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</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=" "><subfield code="m">DE-601</subfield><subfield code="q">pdf/application</subfield><subfield code="u">http://www.gbv.de/dms/bowker/toc/9781466513457.pdf</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</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=027240716&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-027240716</subfield></datafield></record></collection> |
| id | DE-604.BV041795184 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:05:33Z |
| institution | BVB |
| isbn | 9781466513457 |
| language | English |
| lccn | 2013025935 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027240716 |
| oclc_num | 881857882 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-83 DE-703 |
| owner_facet | DE-473 DE-BY-UBG DE-83 DE-703 |
| physical | XIX, 295 S. |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | CRC Press |
| record_format | marc |
| series2 | An Auerbach book |
| spelling | Meduna, Alexander 1957- Verfasser (DE-588)120675617 aut Formal languages and computation models and their applications Alexander Meduna Boca Raton [u.a.] CRC Press 2014 XIX, 295 S. txt rdacontent n rdamedia nc rdacarrier An Auerbach book Includes bibliographical references and index Formale Sprache (DE-588)4017848-1 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 s Programmierung (DE-588)4076370-5 s Programmiersprache (DE-588)4047409-4 s DE-604 DE-601 pdf/application http://www.gbv.de/dms/bowker/toc/9781466513457.pdf Inhaltsverzeichnis Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027240716&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Meduna, Alexander 1957- Formal languages and computation models and their applications Formale Sprache (DE-588)4017848-1 gnd Programmiersprache (DE-588)4047409-4 gnd Programmierung (DE-588)4076370-5 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4047409-4 (DE-588)4076370-5 |
| title | Formal languages and computation models and their applications |
| title_auth | Formal languages and computation models and their applications |
| title_exact_search | Formal languages and computation models and their applications |
| title_full | Formal languages and computation models and their applications Alexander Meduna |
| title_fullStr | Formal languages and computation models and their applications Alexander Meduna |
| title_full_unstemmed | Formal languages and computation models and their applications Alexander Meduna |
| title_short | Formal languages and computation |
| title_sort | formal languages and computation models and their applications |
| title_sub | models and their applications |
| topic | Formale Sprache (DE-588)4017848-1 gnd Programmiersprache (DE-588)4047409-4 gnd Programmierung (DE-588)4076370-5 gnd |
| topic_facet | Formale Sprache Programmiersprache Programmierung |
| url | http://www.gbv.de/dms/bowker/toc/9781466513457.pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027240716&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT medunaalexander formallanguagesandcomputationmodelsandtheirapplications |
There is no print copy available.
Indexes