Regulated grammars and automata:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer
2014
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XX, 694 S. graph. Darst. |
| ISBN: | 9781493903689 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041815371 | ||
| 003 | DE-604 | ||
| 005 | 20230612 | ||
| 007 | t | ||
| 008 | 140424s2014 d||| |||| 00||| eng d | ||
| 020 | |a 9781493903689 |9 978-1-4939-0368-9 | ||
| 035 | |a (OCoLC)891524553 | ||
| 035 | |a (DE-599)BVBBV041815371 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Meduna, Alexander |d 1957- |e Verfasser |0 (DE-588)120675617 |4 aut | |
| 245 | 1 | 0 | |a Regulated grammars and automata |c Alexander Meduna ; Petr Zemek |
| 264 | 1 | |a New York, NY |b Springer |c 2014 | |
| 300 | |a XX, 694 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |D s |
| 689 | 0 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Zemek, Petr |e Verfasser |0 (DE-588)1053386176 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4939-0369-6 |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027260626&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027260626 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152143124365312 |
|---|---|
| adam_text | Titel: Regulated grammars and automata
Autor: Meduna, Alexander
Jahr: 2014
Contents
Part I Introduction and Terminology
1 Introduction..................................................................................................................................3
References........................................................................................................................................7
2 Mathematical Background................................................................................................9
2.1 Sets and Sequences......................................................................................................10
2.2 Relations............................................................................................................................11
2.3 Functions..........................................................................................................................12
2.4 Graphs................................................................................................................................12
References........................................................................................................................................13
3 Rudiments of Formal Language Theory..................................................................15
3.1 Strings and Languages..............................................................................................16
3.2 Language Families......................................................................................................19
3.3 Grammars..........................................................................................................................20
3.4 Automata..........................................................................................................................31
References........................................................................................................................................35
Part II Regulated Grammars: Fundamentals
4 Context-Based Grammatical Regulation................................................................39
4.1 Classical Grammars Viewed as Tight-Context
Regulated Grammars..................................................................................................40
4.1.1 Normal Forms............................................................................................40
4.1.2 Uniform Rewriting ..................................................................................47
4.2 Context-Conditional Grammars..........................................................................56
4.2.1 Definitions....................................................................................................56
4.2.2 Generative Power......................................................................................57
4.3 Random Context Grammars..................................................................................63
4.3.1 Definitions and Examples....................................................................64
4.3.2 Generative Power......................................................................................65
XV
xvi Contents
4.4 Generalized Forbidding Grammars....................................................................68
4.4.1 Definitions....................................................................................................69
4.4.2 Generative Power and Reduction....................................................69
4.5 Semi-Conditional Grammars................................................................................84
4.5.1 Definitions and Examples....................................................................84
4.5.2 Generative Power......................................................................................86
4.6 Simple Semi-Conditional Grammars................................................................88
4.6.1 Definitions and Examples....................................................................88
4.6.2 Generative Power and Reduction....................................................89
4.7 Scattered Context Grammars................................................................................119
4.7.1 Definitions and Examples....................................................................119
4.7.2 Generative Power......................................................................................123
4.7.3 Normal Forms ............................................................................................124
4.7.4 Reduction......................................................................................................126
4.7.5 LL Scattered Context Grammars ....................................................149
References........................................................................................................................................153
5 Rule-Based Grammatical Regulation........................................................................155
5.1 Regular-Controlled Grammars..............................................................................156
5.1.1 Definitions and Examples....................................................................156
5.1.2 Generative Power......................................................................................160
5.2 Matrix Grammars........................................................................................................160
5.2.1 Definitions and Examples....................................................................161
5.2.2 Generative Power......................................................................................163
5.3 Programmed Grammars............................................................................................163
5.3.1 Definitions and Examples....................................................................163
5.3.2 Generative Power......................................................................................165
5.3.3 Normal Forms ............................................................................................166
5.3.4 Restricted Non-Determinism..............................................................174
5.4 State Grammars............................................................................................................184
5.4.1 Definitions and Examples....................................................................184
5.4.2 Generative Power......................................................................................186
References........................................................................................................................................187
Part III Regulated Grammars: Special Topics
6 One-Sided Versions of Random Context Grammars......................................191
6.1 Definitions and Examples........................................................................................194
6.2 Generative Power..........................................................................................................198
6.2.1 One-Sided Random Context Grammars......................................198
6.2.2 One-Sided Forbidding Grammars ..................................................203
6.2.3 One-Sided Permitting Grammars....................................................213
Contents xvii
6.3 Normal Forms................................................................................................................215
6.4 Reduction..........................................................................................................................223
6.4.1 Total Number of Nonterminals........................................................224
6.4.2 Number of Left and Right Random Context
Nonterminals................................................................................................231
6.4.3 Number of Right Random Context Rules..................................237
6.5 Leftmost Derivations..................................................................................................244
6.5.1 Type-1 Leftmost Derivations..............................................................245
6.5.2 Type-2 Leftmost Derivations..............................................................248
6.5.3 Type-3 Leftmost Derivations..............................................................253
6.6 Generalized One-Sided Forbidding Grammars..........................................256
6.6.1 Definitions and Examples....................................................................257
6.6.2 Generative Power......................................................................................259
6.7 LL One-Sided Random Context Grammars..................................................267
6.7.1 Definitions....................................................................................................268
6.7.2 A Motivational Example......................................................................270
6.7.3 Generative Power......................................................................................271
References........................................................................................................................................277
7 On Erasing Rules and Their Elimination................................................................281
7.1 Elimination of Erasing Rules from Context-Free Grammars............282
7.1.1 The Standard Algorithm........................................................................282
7.1.2 A New Algorithm......................................................................................284
7.1.3 Can Erasing Rules Be Eliminated from
Regulated Grammars?............................................................................291
7.2 Workspace Theorems for Regular-Controlled Grammars....................293
7.3 Generalized Restricted Erasing in Scattered Context Grammars .. 310
References........................................................................................................................................328
8 Extension of Languages Resulting from Regulated Grammars..............329
8.1 Regular-Controlled Generators............................................................................330
8.2 Coincidental Extension of Scattered Context Languages....................346
References................................................................................................348
9 Sequential Rewriting Over Word Monoids............................................................351
9.1 Definitions........................................................................................................................352
9.2 Generative Power..........................................................................................................352
References........................................................................................................................................361
Part IV Regulated Grammars: Parallelism
10 Regulated ETOL Grammars..............................................................................................365
10.1 Context-Conditional ETOL Grammars............................................................367
10.1.1 Definitions....................................................................................................367
10.1.2 Generative Power......................................................................................368
xviii Contents
10.2 Forbidding ETOL Grammars..................................................................................375
10.2.1 Definitions and Examples....................................................................375
10.2.2 Generative Power and Reduction....................................................377
10.3 Simple Semi-Conditional ETOL Grammars..................................................396
10.3.1 Definitions....................................................................................................396
10.3.2 Generative Power and Reduction....................................................397
10.4 Left Random Context ETOL Grammars..........................................................411
10.4.1 Definitions and Examples....................................................................411
10.4.2 Generative Power and Reduction....................................................414
References........................................................................................................................................428
11 Uniform Regulated Rewriting in Parallel................................................................431
11.1 Semi-Parallel Uniform Rewriting......................................................................432
11.2 Parallel Uniform Rewriting....................................................................................439
References........................................................................................................................................444
12 Parallel Rewriting Over Word Monoids..................................................................445
12.1 Definitions........................................................................................................................445
12.2 Generative Power..........................................................................................................446
References........................................................................................................................................453
Part V Regulated Grammar Systems
13 Regulated Multigenerative Grammar Systems..................................................457
13.1 Multigenerative Grammar Systems....................................................................459
13.2 Leftmost Multigenerative Grammar Systems..............................................475
References........................................................................................................................................489
14 Controlled Pure Grammar Systems............................................................................491
14.1 Definitions and Examples........................................................................................492
14.2 Generative Power..........................................................................................................495
References........................................................................................................................................504
Part VI Regulated Automata
15 Self-Regulating Automata..................................................................................................509
15.1 Self-Regulating Finite Automata........................................................................510
15.1.1 Definitions and Examples....................................................................511
15.1.2 Accepting Power........................................................................................513
15.2 Self-Regulating Pushdown Automata..............................................................526
15.2.1 Definitions....................................................................................................526
15.2.2 Accepting Power........................................................................................527
References........................................................................................................................................530
Contents xix
16 Automata Regulated by Control Languages..........................................................531
16.1 Finite Automata Regulated by Control Languages..................................532
16.1.1 Definitions....................................................................................................533
16.1.2 Conversions..................................................................................................534
16.1.3 Regular-Controlled Finite Automata............................................536
16.1.4 Context-Free-Controlled Finite Automata..................................537
16.1.5 Program-Controlled Finite Automata............................................537
16.2 Pushdown Automata Regulated by Control Languages........................547
16.2.1 Definitions....................................................................................................548
16.2.2 Regular-Controlled Pushdown Automata..................................549
16.2.3 Linear-Controlled Pushdown Automata......................................550
16.2.4 One-Turn Linear-Controlled Pushdown Automata..............558
References........................................................................................................................................563
Part VII Related Unregulated Automata
17 Jumping Finite Automata....................................................................................................567
17.1 Definitions and Examples........................................................................................569
17.2 Basic Properties............................................................................................................571
17.3 Relations with Well-Known Language Families........................................573
17.4 Closure Properties........................................................................................................574
17.5 Decidability......................................................................................................................578
17.6 An Infinite Hierarchy of Language Families................................................579
17.7 Left and Right Jumps ................................................................................................580
17.8 A Variety of Start Configurations........................................................................582
References........................................................................................................................................585
18 Deep Pushdown Automata..................................................................................................587
18.1 Definitions and Examples........................................................................................589
18.2 Accepting Power..........................................................................................................591
References........................................................................................................................................601
Part VIII Applications
19 Applications: Overview........................................................................................................605
19.1 Current Applications..................................................................................................605
19.2 Perspectives......................................................................................................................609
References........................................................................................................................................612
20 Case Studies..................................................................................................................................615
20.1 Linguistics........................................................................................................................616
20.1.1 Syntax and Related Linguistic Terminology............................617
20.1.2 Transformational Scattered Context Grammars......................621
20.1.3 Scattered Context in English Syntax..............................................624
XX Contents
20.2 Biology..............................................................................................................................634
20.2.1 Simulation of Biological Organisms..............................................634
20.2.2 Implementation..........................................................................................642
20.3 Compilers..........................................................................................................................648
20.3.1 Underlying Formal Model ..................................................................648
20.3.2 Implementation..........................................................................................649
References........................................................................................................................................650
Part IX Conclusion
21 Concluding Remarks..............................................................................................................653
21.1 New Trends and Their Expected Investigation............................................654
21.2 Open Problem Areas..................................................................................................655
21.3 Bibliographical and Historical Remarks........................................................657
References........................................................................................................................................660
22 Summary........................................................................................................................................669
References........................................................................................................................................678
Language Family Index..................................................................................................................679
Subject Index..........................................................................................................................................685
|
| any_adam_object | 1 |
| author | Meduna, Alexander 1957- Zemek, Petr |
| author_GND | (DE-588)120675617 (DE-588)1053386176 |
| author_facet | Meduna, Alexander 1957- Zemek, Petr |
| author_role | aut aut |
| author_sort | Meduna, Alexander 1957- |
| author_variant | a m am p z pz |
| building | Verbundindex |
| bvnumber | BV041815371 |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)891524553 (DE-599)BVBBV041815371 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| 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>01712nam a2200433 c 4500</leader><controlfield tag="001">BV041815371</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230612 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140424s2014 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781493903689</subfield><subfield code="9">978-1-4939-0368-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)891524553</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041815371</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004.0151</subfield><subfield code="2">23</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">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">Regulated grammars and automata</subfield><subfield code="c">Alexander Meduna ; Petr Zemek</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 694 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">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zemek, Petr</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1053386176</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</subfield><subfield code="z">978-1-4939-0369-6</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=027260626&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-027260626</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></record></collection> |
| id | DE-604.BV041815371 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:06:01Z |
| institution | BVB |
| isbn | 9781493903689 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027260626 |
| oclc_num | 891524553 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XX, 694 S. graph. Darst. |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Springer |
| record_format | marc |
| spelling | Meduna, Alexander 1957- Verfasser (DE-588)120675617 aut Regulated grammars and automata Alexander Meduna ; Petr Zemek New York, NY Springer 2014 XX, 694 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Informatik Computer science Information theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd rswk-swf Automat Automatentheorie (DE-588)4831958-2 gnd rswk-swf Automat Automatentheorie (DE-588)4831958-2 s Formale Sprache (DE-588)4017848-1 s 1\p DE-604 Zemek, Petr Verfasser (DE-588)1053386176 aut Erscheint auch als Online-Ausgabe 978-1-4939-0369-6 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027260626&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Meduna, Alexander 1957- Zemek, Petr Regulated grammars and automata Informatik Computer science Information theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd Automat Automatentheorie (DE-588)4831958-2 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4831958-2 |
| title | Regulated grammars and automata |
| title_auth | Regulated grammars and automata |
| title_exact_search | Regulated grammars and automata |
| title_full | Regulated grammars and automata Alexander Meduna ; Petr Zemek |
| title_fullStr | Regulated grammars and automata Alexander Meduna ; Petr Zemek |
| title_full_unstemmed | Regulated grammars and automata Alexander Meduna ; Petr Zemek |
| title_short | Regulated grammars and automata |
| title_sort | regulated grammars and automata |
| topic | Informatik Computer science Information theory Computational complexity Formale Sprache (DE-588)4017848-1 gnd Automat Automatentheorie (DE-588)4831958-2 gnd |
| topic_facet | Informatik Computer science Information theory Computational complexity Formale Sprache Automat Automatentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027260626&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT medunaalexander regulatedgrammarsandautomata AT zemekpetr regulatedgrammarsandautomata |