On the descriptional and algorithmic complexity of regular languages:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Hochschulschrift/Dissertation Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Lichtenberg (Odw.)
Harland Media
2010
|
| Schlagwörter: | |
| Links: | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022620140&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| Umfang: | XVI, 174 Seiten Illustrationen, Diagramme 21 cm |
| ISBN: | 9783938363621 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV037468327 | ||
| 003 | DE-604 | ||
| 005 | 20240425 | ||
| 007 | t| | ||
| 008 | 110609s2010 gw a||| m||| 00||| eng d | ||
| 015 | |a 10,A25 |2 dnb | ||
| 016 | 7 | |a 998400602 |2 DE-101 | |
| 020 | |a 9783938363621 |c kart. |9 978-3-938363-62-1 | ||
| 035 | |a (OCoLC)608733378 | ||
| 035 | |a (DE-599)DNB998400602 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE | ||
| 049 | |a DE-703 |a DE-83 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 005.131 |2 22/ger | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 555 |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Gruber, Hermann |e Verfasser |0 (DE-588)140365036 |4 aut | |
| 245 | 1 | 0 | |a On the descriptional and algorithmic complexity of regular languages |c Hermann Gruber |
| 264 | 1 | |a Lichtenberg (Odw.) |b Harland Media |c 2010 | |
| 300 | |a XVI, 174 Seiten |b Illustrationen, Diagramme |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Universität Gießen |d 2009 | ||
| 650 | 0 | 7 | |a Reguläre Sprache |0 (DE-588)4477611-1 |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 Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |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 | |5 DE-604 | |
| 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=022620140&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-022620140 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0001 2024 A 1567 |
|---|---|
| DE-BY-TUM_katkey | 2788277 |
| DE-BY-TUM_location | Mag |
| DE-BY-TUM_media_number | 040009086666 |
| _version_ | 1821936781070696448 |
| adam_text | 6.3 APPROXIMABILITY FOR GIVEN DFA 56 CONTENTS PREFACE VII I GETTING
STARTED 1 1 INTRODUCTION 3 2 BASIC NOTIONS 9 2.1 WORDS AND LANGUAGES 9
2.2 REGULAR LANGUAGES 10 2.2.1 REGULAR EXPRESSIONS 11 2.2.2 FINITE
AUTOMATA 11 2.2.3 THE MYHILL-NERODE RELATION 12 2.2.4 COMPLEXITY
MEASURES FOR REGULAR LANGUAGES 13 2.2.5 BASIC RELATIONS BETWEEN
COMPLEXITY MEASURES 15 2.3 GRAPHS AND DIGRAPHS 16 2.3.1 SUBGRAPHS AND
CONNECTEDNESS 17 2.3.2 BIPARTITE GRAPHS 17 2.4 COMPUTATIONAL COMPLEXITY
18 2.4.1 OVERVIEW OF COMPLEXITY CLASSES 18 2.4.2 REDUEIBILITY AND
COMPLETENESS 19 II NONDETERMINISTIC FINITE AUTOMATA 21 3 PROVING LOWER
BOUNDS FOR NONDETERMINISTIC STATE COMPLEXITY 23 3.1 TWO USEFUL LOWER
BOUND TECHNIQUES 24 3.2 THE DEPENDENCY GRAPH 26 4 MINIMAL NFAS: NUMBER
OF STATES AND NUMBER OF TRANSITIONS 29 4.1 A TRADE-OFF FOR STATE VERSUS
TRANSITION MINIMIZATION 29 4.2 NONDETERMINISTIC STATE AND TRANSITION
COMPLEXITY 35 5 COMPUTATIONAL COMPLEXITY OF NFA MINIMIZATION 39 5.1
COMPUTATIONAL COMPLEXITY FOR GIVEN EXPLICIT DESCRIPTION 39 5.2
COMPUTATIONAL COMPLEXITY FOR GIVEN DFA OR NFA 40 6 APPROXIMATION
COMPLEXITY OF NFA MINIMIZATION 47 6.1 BASIC NOTIONS IN APPROXIMATION
COMPLEXITY 48 6.2 APPROXIMABILITY FOR GIVEN EXPLICIT DESCRIPTION 49
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/998400602 DIGITALISIERT
DURCH 6.4 APPROXIMABILITY FOR GIVEN NFA 59 7 SUMMARY OF RESULTS ON NFA
MINIMIZATION 63 III CONVERTING FINITE AUTOMATA INTO REGULAR EXPRESSIONS
67 8 LOWER BOUNDS FOR THE CONVERSION PROBLEM: INFINITE LANGUAGES 69 8.1
DIGRAPH CONNECTIVITY MEASURES AND STAR HEIGHT OF REGULAR LANGUAGES . .
70 8.2 STAR HEIGHT AND REGULAR EXPRESSION SIZE 74 8.3 CYCLE RANK VIA A
COPS AND ROBBER GAME 76 8.4 CONVERTING DFAS INTO REGULAR EXPRESSIONS 78
8.5 CONVERTING PLANAR DFAS INTO REGULAR EXPRESSIONS 81 9 LOWER BOUNDS
FOR THE CONVERSION PROBLEM: FINITE LANGUAGES 83 9.1 COMMUNICATION
COMPLEXITY 84 9.2 PROTOCOL PARTITION NUMBER AND REGULAR EXPRESSION SIZE
85 9.3 CONVERTING DFAS INTO REGULAR EXPRESSIONS: FINITE LANGUAGES 88 10
UPPER BOUNDS FOR THE CONVERSION PROBLEM 95 10.1 THE STATE ELIMINATION
SCHEME 96 10.2 UNDIRECTED CYCLE RANK AND ELIMINATION ORDERINGS 99 10.3
CONVERTING DFAS INTO REGULAR EXPRESSIONS: AN UPPER BOUND 103 11 SUMMARY
OF RESULTS ON THE CONVERSION PROBLEM 109 RV LANGUAGE OPERATIONS ON
REGULAR EXPRESSIONS 111 12 INTERSECTION, INTERLEAVING AND
COMPLEMENTATION 113 12.1 ALPHABETIC WIDTH OF INTERSECTION AND
INTERLEAVING 114 12.2 ALPHABETIC WIDTH OF COMPLEMENTATION 120 13
EXTENDED REGULAR EXPRESSIONS 125 13.1 REGULAR EXPRESSIONS WITH
INTERSECTION 126 13.2 REGULAR EXPRESSIONS WITH INTERLEAVING 128 1
|
| any_adam_object | 1 |
| author | Gruber, Hermann |
| author_GND | (DE-588)140365036 |
| author_facet | Gruber, Hermann |
| author_role | aut |
| author_sort | Gruber, Hermann |
| author_variant | h g hg |
| building | Verbundindex |
| bvnumber | BV037468327 |
| classification_rvk | ST 136 |
| classification_tum | DAT 555 |
| ctrlnum | (OCoLC)608733378 (DE-599)DNB998400602 |
| 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 | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01822nam a2200457 c 4500</leader><controlfield tag="001">BV037468327</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240425 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">110609s2010 gw a||| m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,A25</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">998400602</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783938363621</subfield><subfield code="c">kart.</subfield><subfield code="9">978-3-938363-62-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)608733378</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB998400602</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.131</subfield><subfield code="2">22/ger</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">DAT 555</subfield><subfield code="2">stub</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">Gruber, Hermann</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140365036</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the descriptional and algorithmic complexity of regular languages</subfield><subfield code="c">Hermann Gruber</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Lichtenberg (Odw.)</subfield><subfield code="b">Harland Media</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 174 Seiten</subfield><subfield code="b">Illustrationen, 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">Universität Gießen</subfield><subfield code="d">2009</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">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">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="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">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</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=" "><subfield code="5">DE-604</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=022620140&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-022620140</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV037468327 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T15:17:31Z |
| institution | BVB |
| isbn | 9783938363621 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-022620140 |
| oclc_num | 608733378 |
| open_access_boolean | |
| owner | DE-703 DE-83 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-703 DE-83 DE-91 DE-BY-TUM DE-634 |
| physical | XVI, 174 Seiten Illustrationen, Diagramme 21 cm |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Harland Media |
| record_format | marc |
| spellingShingle | Gruber, Hermann On the descriptional and algorithmic complexity of regular languages Reguläre Sprache (DE-588)4477611-1 gnd Endlicher Automat (DE-588)4224518-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| subject_GND | (DE-588)4477611-1 (DE-588)4224518-7 (DE-588)4134751-1 (DE-588)4113937-9 |
| title | On the descriptional and algorithmic complexity of regular languages |
| title_auth | On the descriptional and algorithmic complexity of regular languages |
| title_exact_search | On the descriptional and algorithmic complexity of regular languages |
| title_full | On the descriptional and algorithmic complexity of regular languages Hermann Gruber |
| title_fullStr | On the descriptional and algorithmic complexity of regular languages Hermann Gruber |
| title_full_unstemmed | On the descriptional and algorithmic complexity of regular languages Hermann Gruber |
| title_short | On the descriptional and algorithmic complexity of regular languages |
| title_sort | on the descriptional and algorithmic complexity of regular languages |
| topic | Reguläre Sprache (DE-588)4477611-1 gnd Endlicher Automat (DE-588)4224518-7 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
| topic_facet | Reguläre Sprache Endlicher Automat Berechnungskomplexität Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022620140&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT gruberhermann onthedescriptionalandalgorithmiccomplexityofregularlanguages |
Inhaltsverzeichnis
Paper/Kapitel scannen lassen
Paper/Kapitel scannen lassen
Bibliotheksmagazin
| Signatur: |
0001 2024 A 1567 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |