Modern aspects of classical automata theory: finite automata, biautomata, and lossy compression
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Logos Verlag
2015
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | X, 198 Seiten Diagramme 21 cm |
| ISBN: | 9783832539443 3832539441 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV042643121 | ||
| 003 | DE-604 | ||
| 005 | 20160322 | ||
| 007 | t | ||
| 008 | 150626s2015 gw |||| m||| 00||| eng d | ||
| 015 | |a 15,N13 |2 dnb | ||
| 015 | |a 15,A24 |2 dnb | ||
| 015 | |a 15,H07 |2 dnb | ||
| 016 | 7 | |a 1068597747 |2 DE-101 | |
| 020 | |a 9783832539443 |c kart. : EUR 37.00 (DE), EUR 38.00 (AT), sfr 49.90 (freier Pr.) |9 978-3-8325-3944-3 | ||
| 020 | |a 3832539441 |9 3-8325-3944-1 | ||
| 024 | 3 | |a 9783832539443 | |
| 035 | |a (OCoLC)905727447 | ||
| 035 | |a (DE-599)DNB1068597747 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-473 |a DE-29T | ||
| 082 | 0 | |a 004.0151135 |2 22/ger | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Jakobi, Sebastian |e Verfasser |0 (DE-588)1064867456 |4 aut | |
| 245 | 1 | 0 | |a Modern aspects of classical automata theory |b finite automata, biautomata, and lossy compression |c Sebastian Jakobi |
| 264 | 1 | |a Berlin |b Logos Verlag |c 2015 | |
| 300 | |a X, 198 Seiten |b Diagramme |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Justus-Liebig-Universität Gießen |d 2014 | ||
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenkompression |0 (DE-588)4121121-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reguläre Sprache |0 (DE-588)4477611-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Beschreibungskomplexität |0 (DE-588)4797485-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 653 | |a Automata Theory / Automatentheorie | ||
| 653 | |a Regular Languages / Reguläre Sprachen | ||
| 653 | |a Finite Automata / Endliche Automaten | ||
| 653 | |a Biautomata / Biautomaten | ||
| 653 | |a Lossy Compression / Verlustbehaftete Komprimierung | ||
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Reguläre Sprache |0 (DE-588)4477611-1 |D s |
| 689 | 0 | 2 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 3 | |a Beschreibungskomplexität |0 (DE-588)4797485-0 |D s |
| 689 | 0 | 4 | |a Datenkompression |0 (DE-588)4121121-2 |D s |
| 689 | 0 | 5 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=5179423&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 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=028075461&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-028075461 | |
Datensatz im Suchindex
| _version_ | 1809771746284273664 |
|---|---|
| adam_text |
CONTENTS
PREFACE V
I PREAMBLE 1
1 INTRODUCTION 3
2 BASIC CONCEPTS AND DEFINITIONS 11
2.1 WORDS AND LANGUAGES 11
2.2 REGULAR LANGUAGES AND REGULAR EXPRESSIONS 13
2.3 FINITE AUTOMATA 15
2.4 COMPUTATIONAL COMPLEXITY 22
II LOSSY COMPRESSION OF FINITE AUTOMATA 25
3 ERROR PROFILES 27
3.1 ALMOST-EQUIVALENCE AND HYPER-MINIMALITY 29
3.2 ^-EQUIVALENCE AND I?-MINIMALITY 35
3.3 FURTHER ERROR PROFILES 38
4 COMPLEXITY OF PROBLEMS RELATED TO MINIMAL FINITE AUTOMATA 41
4.1 EQUIVALENCE PROBLEMS 42
4.2 MINIMIZATION AND MINIMALITY PROBLEMS 45
4.2.1 MINIMAL DETERMINISTIC FINITE AUTOMATA 45
4.2.2 MINIMAL NONDETERMINISTIC FINITE AUTOMATA 52
4.3 CANONICITY PROBLEMS 58
4.3.1 DETERMINISTIC FINITE AUTOMATA 60
4.3.2 NONDETERMINISTIC FINITE AUTOMATA 62
4.4 COUNTING PROBLEMS 64
HTTP://D-NB.INFO/1068597747
5 BRZOZOWSKI-LIKE MINIMIZATION ALGORITHMS 71
5.1 STRUCTURAL CHARACTERIZATION OF -E-EQUIVALENT STATES 75
5.2 F-MERGEABILITY OF STATES 77
5.3 HYPER-MINIMIZATION 81
5.4 MINIMAL COVER AUTOMATA 83
5.5 /C-MINIMIZATION 86
III BIAUTOMATA 89
6 BASIC PROPERTIES OF BIAUTOMATA 91
6.1 THE BIAUTOMATON MODEL 92
6.2 STRUCTURAL PROPERTIES FOR BIAUTOMATA 96
6.2.1 BIAUTOMATA WITH O- AND F-PROPERTY 101
7 LANGUAGE CLASSES RELATED TO DIFFERENT TYPES OF BIAUTOMATA 105
7.1 LINEAR CONTEXT-FREE LANGUAGES 106
7.2 REGULAR LANGUAGES 116
7.2.1 SUBREGULAR LANGUAGE CLASSES 117
7.3 THE DUAL OF A BIAUTOMATON 119
8 DESCRIPTIONAL COMPLEXITY OF CONVERSIONS FOR BIAUTOMATA 125
8.1 FROM FINITE AUTOMATA TO BIAUTOMATA 129
8.2 FROM REGULAR EXPRESSIONS TO BIAUTOMATA 132
8.3 FROM SYNTACTIC MONOIDS TO BIAUTOMATA 135
8.4 COMPLEXITY OF THE O- AND F-PROPERTIES 138
9 MINIMIZATION ALGORITHMS FOR BIAUTOMATA 143
9.1 EFFICIENT STATE MERGING ALGORITHMS 143
9.2 BRZOZOWSKI-LIKE MINIMIZATION OF BIAUTOMATA 147
9.3 ON THE IMPORTANCE OF THE O- AND F-PROPERTIES 151
10 LOSSY COMPRESSION OF BIAUTOMATA 155
10.1 ON THE STRUCTURE OF ALMOST-EQUIVALENT BIAUTOMATA 156
10.2 COMPUTATIONAL COMPLEXITY OF BIAUTOMATA MINIMIZATION PROBLEMS 162
IV OUTRO 177
11 CONCLUSIONS AND DIRECTIONS FOR FURTHER RESEARCH 179
BIBLIOGRAPHY 183
INDEX 194
VI N |
| any_adam_object | 1 |
| author | Jakobi, Sebastian |
| author_GND | (DE-588)1064867456 |
| author_facet | Jakobi, Sebastian |
| author_role | aut |
| author_sort | Jakobi, Sebastian |
| author_variant | s j sj |
| building | Verbundindex |
| bvnumber | BV042643121 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)905727447 (DE-599)DNB1068597747 |
| dewey-full | 004.0151135 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151135 |
| dewey-search | 004.0151135 |
| dewey-sort | 14.0151135 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV042643121</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160322</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">150626s2015 gw |||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">15,N13</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">15,A24</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">15,H07</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1068597747</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783832539443</subfield><subfield code="c">kart. : EUR 37.00 (DE), EUR 38.00 (AT), sfr 49.90 (freier Pr.)</subfield><subfield code="9">978-3-8325-3944-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3832539441</subfield><subfield code="9">3-8325-3944-1</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783832539443</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)905727447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1068597747</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151135</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jakobi, Sebastian</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1064867456</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modern aspects of classical automata theory</subfield><subfield code="b">finite automata, biautomata, and lossy compression</subfield><subfield code="c">Sebastian Jakobi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Logos Verlag</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 198 Seiten</subfield><subfield code="b">Diagramme</subfield><subfield code="c">21 cm</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Justus-Liebig-Universität Gießen</subfield><subfield code="d">2014</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">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenkompression</subfield><subfield code="0">(DE-588)4121121-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reguläre Sprache</subfield><subfield code="0">(DE-588)4477611-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beschreibungskomplexität</subfield><subfield code="0">(DE-588)4797485-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Automata Theory / Automatentheorie</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Regular Languages / Reguläre Sprachen</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Finite Automata / Endliche Automaten</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Biautomata / Biautomaten</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lossy Compression / Verlustbehaftete Komprimierung</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</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">Reguläre Sprache</subfield><subfield code="0">(DE-588)4477611-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Beschreibungskomplexität</subfield><subfield code="0">(DE-588)4797485-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Datenkompression</subfield><subfield code="0">(DE-588)4121121-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="5"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</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">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=5179423&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=028075461&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-028075461</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV042643121 |
| illustrated | Not Illustrated |
| indexdate | 2024-09-10T01:47:11Z |
| institution | BVB |
| isbn | 9783832539443 3832539441 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028075461 |
| oclc_num | 905727447 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-29T |
| owner_facet | DE-473 DE-BY-UBG DE-29T |
| physical | X, 198 Seiten Diagramme 21 cm |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Logos Verlag |
| record_format | marc |
| spelling | Jakobi, Sebastian Verfasser (DE-588)1064867456 aut Modern aspects of classical automata theory finite automata, biautomata, and lossy compression Sebastian Jakobi Berlin Logos Verlag 2015 X, 198 Seiten Diagramme 21 cm txt rdacontent n rdamedia nc rdacarrier Dissertation Justus-Liebig-Universität Gießen 2014 Automatentheorie (DE-588)4003953-5 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Datenkompression (DE-588)4121121-2 gnd rswk-swf Reguläre Sprache (DE-588)4477611-1 gnd rswk-swf Beschreibungskomplexität (DE-588)4797485-0 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Automata Theory / Automatentheorie Regular Languages / Reguläre Sprachen Finite Automata / Endliche Automaten Biautomata / Biautomaten Lossy Compression / Verlustbehaftete Komprimierung (DE-588)4113937-9 Hochschulschrift gnd-content Automatentheorie (DE-588)4003953-5 s Reguläre Sprache (DE-588)4477611-1 s Berechnungskomplexität (DE-588)4134751-1 s Beschreibungskomplexität (DE-588)4797485-0 s Datenkompression (DE-588)4121121-2 s Endlicher Automat (DE-588)4224518-7 s DE-604 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=5179423&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028075461&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Jakobi, Sebastian Modern aspects of classical automata theory finite automata, biautomata, and lossy compression Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Datenkompression (DE-588)4121121-2 gnd Reguläre Sprache (DE-588)4477611-1 gnd Beschreibungskomplexität (DE-588)4797485-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4224518-7 (DE-588)4121121-2 (DE-588)4477611-1 (DE-588)4797485-0 (DE-588)4134751-1 (DE-588)4113937-9 |
| title | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression |
| title_auth | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression |
| title_exact_search | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression |
| title_full | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression Sebastian Jakobi |
| title_fullStr | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression Sebastian Jakobi |
| title_full_unstemmed | Modern aspects of classical automata theory finite automata, biautomata, and lossy compression Sebastian Jakobi |
| title_short | Modern aspects of classical automata theory |
| title_sort | modern aspects of classical automata theory finite automata biautomata and lossy compression |
| title_sub | finite automata, biautomata, and lossy compression |
| topic | Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Datenkompression (DE-588)4121121-2 gnd Reguläre Sprache (DE-588)4477611-1 gnd Beschreibungskomplexität (DE-588)4797485-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Automatentheorie Endlicher Automat Datenkompression Reguläre Sprache Beschreibungskomplexität Berechnungskomplexität Hochschulschrift |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=5179423&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028075461&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT jakobisebastian modernaspectsofclassicalautomatatheoryfiniteautomatabiautomataandlossycompression |