A concise introduction to languages and machines:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
London
Springer
[2008]
|
| Series: | Undergraduate topics in computer science
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | VII, 343 S. Illustrationen, Diagramme |
| ISBN: | 9781848001206 1848001207 9781848001213 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023365332 | ||
| 003 | DE-604 | ||
| 005 | 20230404 | ||
| 007 | t | ||
| 008 | 080626s2008 xxka||| |||| 00||| eng d | ||
| 015 | |a 07,N44,0055 |2 dnb | ||
| 016 | 7 | |a 985964138 |2 DE-101 | |
| 020 | |a 9781848001206 |c Pb. : ca. EUR 28.84 (freier Pr.), ca. sfr 47.00 (freier Pr.) |9 978-1-84800-120-6 | ||
| 020 | |a 1848001207 |c Pb. : ca. EUR 28.84 (freier Pr.), ca. sfr 47.00 (freier Pr.) |9 1-84800-120-7 | ||
| 020 | |a 9781848001213 |c Online |9 978-1-84800-121-3 | ||
| 024 | 3 | |a 9781848001206 | |
| 028 | 5 | 2 | |a 12123674 |
| 035 | |a (OCoLC)315659806 | ||
| 035 | |a (DE-599)DNB985964138 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a xxk |c XA-GB | ||
| 049 | |a DE-20 |a DE-703 |a DE-521 |a DE-824 |a DE-706 |a DE-898 |a DE-188 |a DE-11 | ||
| 082 | 0 | |a 511.3 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 100 | 1 | |a Parkes, Alan P. |d 1955- |e Verfasser |0 (DE-588)1053186606 |4 aut | |
| 245 | 1 | 0 | |a A concise introduction to languages and machines |c Alan P. Parkes |
| 264 | 1 | |a London |b Springer |c [2008] | |
| 300 | |a VII, 343 S. |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Undergraduate topics in computer science | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-84800-121-3 |
| 856 | 4 | 2 | |m OEBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016548699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016548699 | ||
Record in the Search Index
| _version_ | 1804137730131623936 |
|---|---|
| adam_text | CONTENTS 1. INTRODUCTION 1 1.1 OVERVIEW 1 1.2 WHAT THIS BOOK IS ABOUT 1
1.3 WHAT THIS BOOK TRIES TO DO 6 1.4 WHAT THIS BOOK TRIES NOT TU DO 6
1.5 THE EXERCISES 7 1.6 FURTHER READING 7 1.7 SOME ADVICE 7 PART 1
LANGUAGE AND MACHINES 2. ELEMENTS OF FORMAL LANGUAGES 11 2.1 OVERVIEW 11
2.2 ALPHABETS 11 2.3 STRINGS 12 2.3.1 FUNCTIONS THAT APPLY TO STRINGS 12
2.3.2 USCFUL NOTATION FOR DESCRIBING STRINGS 13 2.4 FORMAL LANGUAGES 15
2.5 MCTHODS FOR DEFINING FORMAL LANGUAGES 16 2.5.1 SET DEFINITIONS OF
LANGUAGES 17 2.5.2 DECISION PROGRAMS FOR LANGUAGES 19 2.5.3 RULES FOR
GENCRATING LANGUAGES 20 2.6 FORMAL GRAMMARS 25 2.6.1 GRAMMARS,
DERIVATIONS AND LANGUAGES 26 2.6.2 THE RELATIONSHIP BETWEEN GRAMMARS AND
LANGUAGES 29 A CONCISE INTRODUCTION TO LANGUAGES AND MACHINES 2.7 PHRASE
STRUCTURE GRAMMARS AND THE CHOMSKY HIERARCHY .... 30 2.7.1 FORMAL
DEFINITION OF PHRASE STRUCTURE GRAMMARS .... 30 2.7.2 DERIVATIONS,
SENTENTIAL FORMS, SENTENCES AND L(G) 31 2.7.3 THE CHOMSKY HIERARCHY 35
2.8 A TYPE 0 GRAMMAR: COMPUTATION AS SYMBOL MANIPULATION 38 3. SYNTAX,
SEMANTICS AND AMBIGUITY 43 3.1 OVERVIEW 43 3.2 SYNTAX VS. SEMANTICS 43
3.3 DERIVATION TREES 44 3.4 PARSING 47 3.5 AMBIGUITY 49 4. REGULAER
LANGUAGES AND FINITE STATE RECOGNISERS 55 4.1 OVERVIEW 55 4.2 REGULAER
GRAMMARA 55 4.3 SORNE PROBLEMS WITH GRAMMARS 57 4.4 FINITE STATE
RECOGNISERS AND FINITE STATE GENERATORS 58 4.4.1 CREATING AN FSR 58
4.4.2 THE BEHAVIOUR OF THE FSR 60 4.4.3 THE FSR AS EQUIVALENT TO THE
REGULAER GRAMMAR 64 4.5 NON-DCLERMINISM IN FINITE STATE R.ECOGNISERS 67
4.5.1 CONSTRUCTING DETERMINISTIC FSRS 69 4.5.2 THE DETERMINISTIC FSR AS
EQUIVALENT TO THE NON-DETERMINISTIC FSR 72 4.6 A SIMPLE DETERMINISTIC
DECISION PROGRAM 77 4.7 MINIMAL FSRS 77 4.7.1 CONSTRUCTING A MINIMAL FSR
79 4.7.2 WHY MINIMISATION WORKS 83 4.8 THE GENERAL EQUIVALENCC OF
REGULAER LANGUAGES AND FSRS 86 4.9 OBSERVATIONS ON REGULAER GRAMMARS AND
LANGUAGES 88 5. CONTEXT FRCE LANGUAGES AND PUSHDOWN RECOGNISERS 93 5.1
OVERVIEW 93 5.2 CONTEXT FREE GRAMMARS AND CONTEXT FREE LANGUAGES 94 5.3
CHANGING G WITHOUT CHANGING L(G) 94 5.3.1 THE EMPTY STRING E) 95 5.3.2
CHOMSKY NORMAL FORM 98 5.4 PUSHDOWN RECOGNISERS 104 5.4.1 THE STACK 105
5.4.2 CONSTRUCTING A NON-DETERMINISTIC PDR 105 5.4.3 EXAMPLE NPDRS, M 3
AND M 10 107 CONTENTS 5.5 DETERMINISTIC PUSHDOWN RECOGNISERS 112 5.5.1 M
3D , A DETERMINISTIC VERSION OF M 3 113 5.5.2 MORE DETERMINISTIC PDRS
115 5.6 DETERMINISTIC AND NON-DETERMINISTIC CONTEXT FREE LANGUAGES 116
5.6.1 EVERY REGULAER LANGUAGE IS A DETERMINISTIC CFL 116 5.6.2 THE
NON-DETERMINISTIC CFLS 118 5.6.3 A REFMEMENT TO THE CHOMSKY HIERARCHY IN
THE CASE OF CFLS 120 5.7 THE EQUIVALENCE OF CFGS AND PDRS 121 5.8
OBSERVATIONS ON CONTEXT FREE GRAMMARS AND LANGUAGES .... 121 6.
IMPORTANT FEATURES OF REGULAER AND CONTEXT FREE LANGUAGES 125 6.1
OVERVIEW 125 6.2 CLOSURE PROPERTIES OF LANGUAGES 126 6.3 CLOSURE
PROPERTIES OF THE REGULAER LANGUAGES 126 6.3.1 COMPLEMENT 126 6.3.2 UNION
128 6.3.3 INTERSECTION 129 6.3.4 CONCATENATION 131 6.4 CLOSURE
PROPERTIES OF THE CONTEXT FREE LANGUAGES 133 6.4.1 UNION 133 6.4.2
CONCATENATION 135 6.4.3 INTERSECTION 136 6.4.4 COMPLEMENT 137 6.5
CHOMSKY S HIERARCH Y IS INDEED A PROPER HIERARCHY 138 6.5.1 THE REPEAT
STATE THEOREM 139 6.5.2 A LANGUAGE THAT IS CONTEXT FREE BUT NOT REGULAER
.... 142 6.5.3 THE UVWXY THEOREM FOR CONTEXT FREE LANGUAGES 143 6.5.4
{A &V:I 1} IS NOT CONTEXT FREE 150 6.5.5 THE MULTIPLICATION LANGUAGE
IS NOT CONTEXT FREE 151 6.6 PRELIMINARY OBSERVATIONS ON THE SCOPE OF THE
CHOMSKY HIERARCHY 153 7. PHRASE STRUCTURE LANGUAGES AND TURING MACHINES
155 7.1 OVERVIEW 155 7.2 THE ARCHITECTURE OF THE TURING MACHINE 155
7.2.1 TAPES AND THE READ/WRITE HEAD 156 7.2.2 BLANK SQUARES 157
7.2.3 TM INSTRUCTIONS 158 7.2.4 TURING MACHINES DEFINED 159 A CONCISE
INTRODUCTION TO LANGUAGES AND MACHINES 7.3 THE BEHAVIOUR OF A TM 159 7.4
TURING MACHINES AS LANGUAGE RECOGNISERS 163 7.4.1 REGULAER LANGUAGES 163
7.4.2 CONTEXT FREE LANGUAGES 164 7.4.3 TURING MACHINES ARE MORE POWERFUL
THANPDRS 166 7.5 INTRODUCTION TO (TURING MACHINE) COMPUTABLE LANGUAGES
169 7.6 THE TM AS THE RECOGNISER FOR THE CONTEXT SENSITIVE LANGUAGES 170
7.6.1 CONSTRUCTING A NON-DETERMINISTIC TM FOR REDUCTION PARSING OF A
CONTEXT SENSITIVE LANGUAGE 171 7.6.2 THE GENERALITY OF THE CONSTRUCTION
175 7.7 THE TM AS THE RECOGNISER FOR THE TYPE 0 LANGUAGES 177 7.7.1
AMENDING THE REDUCTION PARSING TM TO DEAL WITH TYPE 0 PRODUCTIONS 178
7.7.2 DEALING WITH THE EMPTY STRING 178 7.7.3 THE TM AS THE RECOGNISER
FOR ALI TYPES IN THE CHOMSKY HIERARCHY 181 7.8 DECIDABILITY: A
PRELIMINARY DISCUSSION 181 7.8.1 DECIDING A LANGUAGE 181 7.8.2 ACCEPTING
A LANGUAGE 183 7.9 END OF PART ONE 184 PART 2 MACHINES AND COMPUTATION
8. FINITE STATE TRANSDUCERS 189 8.1 OVERVIEW 189 8.2 FINITE STATE
TRANSDUCERS 189 8.3 FINITE STATE TRANSDUCERS AND LANGUAGE RECOGNITION
190 8.4 FINITE STATE TRANSDUCERS AND MEMORY 191 8.5 FINITE STATE
TRANSDUCERS AND COMPUTATION 194 8.5.1 SIMPLE MULTIPLICATION 194 8.5.2
ADDITION AND SUBTRACTION 195 8.5.3 SIMPLE DIVISION AND MODULAR
ARITHMETIC 199 8.6 THE LIMITATIONS OF THE FINITE STATE TRANSDUCER 200
8.6.1 RESTRICTED FST MULTIPLICATION 201 8.6.2 FSTS AND UNLIMITED
MULTIPLICATION 204 8.7 FSTS AS UNSUITABLE MODELS FOR REAL COMPUTERS 204
9. TURING MACHINES AS COMPUTERS 209 9.1 OVERVIEW 209 9.2 TURING MACHINES
AND COMPUTATION 209 CONTENTS 9.3 TURING MACHINES AND ARBITRARY BINARY
MULTIPLICATION 210 9.3.1 SOME BASIC TM OPERATIONS 210 9.3.2 THE ADD TM
212 9.3.3 THE MULT TM 215 9.4 TURING MACHINES AND ARBITRARY INTEGER
DIVISION 222 9.4.1 THE SUBTRACT TM 222 9.4.2 THE DIV TM 225 9.5
LOGICAL OPERATIONS 226 9.6 TMS AND THE SIMULATION OF COMPUTER OPERATIONS
229 10. TURING S THESIS AND THE UNIVERSALITY OF THE TURING MACHINE 237
10.1 OVERVICW 237 10.2 TURING S THESIS 238 10.3 CODING A TURING MACHINE
AND ITS TAPE A.S A BINARY NUMBER 240 10.3.1 CODING ANY TM 241 10.3.2
CODING THE TAPE 244 10.4 THE UNIVERSAL TURING MACHINE 244 10.4.1 UTAFS
TAPES 245 10.4.2 THE OPERATION OF UTM 246 10.4.3 SOME IMPLICATIONS OF
UTM 249 10.5 NON-DETERMINISTIC TMS 249 10.6 CONVERTING A
NON-DETERMINISTIC TM INTO A 4-TAPE DETERMINISTIC TM 250 10.6.1 THE FOUR
TAPES OF THE DETERMINIST IC MACHINE, D . . . . 251 10.6.2 THE SYSTEMATIC
GENERATION OF THE STRINGS OF QUINTUPLE LABELS 253 10.6.3 THE OPERATION
OF D 257 10.6.4 THE EQUIVALENCE OF NON-DETERMINISTIC TMS AND 4-TAPE
DETERMINISTIC TMS 260 10.7 CONVERTING A MULTI-TAPE TM INTO A SINGLE-TAPE
TM 261 10.7.1 EXAMPLE: REPRESENTING THREE TAPES AS ONE 263 10.7.2 THE
OPERATION OF THE SINGLE-TAPE MACHINE. 5 265 10.7.3 THE EQUIVALENCE OF
DETERMINISTIC MULTI-TAPE TMS AND DETERMINISTIC SINGLE-TAPE TMS 266 10.8
THE LINGUISTIC IMPLICATIONS OF THE EQUIVALENCE OF NON-DETERMINISTIC AND
DETERMINISTIC TMS 267 11. COMPUTABILITY, SOLVABILITY AND THE HALTING
PROBLEM 269 11.1 OVCRVIEW 269 11.2 THE RELATIONSHIP BETWEEN FUNCTIONS,
PROBLEMS. SOLVABILITY AND DECIDABILITY 270 11.2.1 FUNCTIONS AND
COMPUTABILITY 270 11.2.2 PROBLEMS AND SOLVABILITV 271
|
| adam_txt |
CONTENTS 1. INTRODUCTION 1 1.1 OVERVIEW 1 1.2 WHAT THIS BOOK IS ABOUT 1
1.3 WHAT THIS BOOK TRIES TO DO 6 1.4 WHAT THIS BOOK TRIES NOT TU DO 6
1.5 THE EXERCISES 7 1.6 FURTHER READING 7 1.7 SOME ADVICE 7 PART 1
LANGUAGE AND MACHINES 2. ELEMENTS OF FORMAL LANGUAGES 11 2.1 OVERVIEW 11
2.2 ALPHABETS 11 2.3 STRINGS 12 2.3.1 FUNCTIONS THAT APPLY TO STRINGS 12
2.3.2 USCFUL NOTATION FOR DESCRIBING STRINGS 13 2.4 FORMAL LANGUAGES 15
2.5 MCTHODS FOR DEFINING FORMAL LANGUAGES 16 2.5.1 SET DEFINITIONS OF
LANGUAGES 17 2.5.2 DECISION PROGRAMS FOR LANGUAGES 19 2.5.3 RULES FOR
GENCRATING LANGUAGES 20 2.6 FORMAL GRAMMARS 25 2.6.1 GRAMMARS,
DERIVATIONS AND LANGUAGES 26 2.6.2 THE RELATIONSHIP BETWEEN GRAMMARS AND
LANGUAGES 29 A CONCISE INTRODUCTION TO LANGUAGES AND MACHINES 2.7 PHRASE
STRUCTURE GRAMMARS AND THE CHOMSKY HIERARCHY . 30 2.7.1 FORMAL
DEFINITION OF PHRASE STRUCTURE GRAMMARS . 30 2.7.2 DERIVATIONS,
SENTENTIAL FORMS, SENTENCES AND "L(G)" 31 2.7.3 THE CHOMSKY HIERARCHY 35
2.8 A TYPE 0 GRAMMAR: COMPUTATION AS SYMBOL MANIPULATION 38 3. SYNTAX,
SEMANTICS AND AMBIGUITY 43 3.1 OVERVIEW 43 3.2 SYNTAX VS. SEMANTICS 43
3.3 DERIVATION TREES 44 3.4 PARSING 47 3.5 AMBIGUITY 49 4. REGULAER
LANGUAGES AND FINITE STATE RECOGNISERS 55 4.1 OVERVIEW 55 4.2 REGULAER
GRAMMARA 55 4.3 SORNE PROBLEMS WITH GRAMMARS 57 4.4 FINITE STATE
RECOGNISERS AND FINITE STATE GENERATORS 58 4.4.1 CREATING AN FSR 58
4.4.2 THE BEHAVIOUR OF THE FSR 60 4.4.3 THE FSR AS EQUIVALENT TO THE
REGULAER GRAMMAR 64 4.5 NON-DCLERMINISM IN FINITE STATE R.ECOGNISERS 67
4.5.1 CONSTRUCTING DETERMINISTIC FSRS 69 4.5.2 THE DETERMINISTIC FSR AS
EQUIVALENT TO THE NON-DETERMINISTIC FSR 72 4.6 A SIMPLE DETERMINISTIC
DECISION PROGRAM 77 4.7 MINIMAL FSRS 77 4.7.1 CONSTRUCTING A MINIMAL FSR
79 4.7.2 WHY MINIMISATION WORKS 83 4.8 THE GENERAL EQUIVALENCC OF
REGULAER LANGUAGES AND FSRS 86 4.9 OBSERVATIONS ON REGULAER GRAMMARS AND
LANGUAGES 88 5. CONTEXT FRCE LANGUAGES AND PUSHDOWN RECOGNISERS 93 5.1
OVERVIEW 93 5.2 CONTEXT FREE GRAMMARS AND CONTEXT FREE LANGUAGES 94 5.3
CHANGING G WITHOUT CHANGING L(G) 94 5.3.1 THE EMPTY STRING \E) 95 5.3.2
CHOMSKY NORMAL FORM 98 5.4 PUSHDOWN RECOGNISERS 104 5.4.1 THE STACK 105
5.4.2 CONSTRUCTING A NON-DETERMINISTIC PDR 105 5.4.3 EXAMPLE NPDRS, M 3
AND M 10 107 CONTENTS 5.5 DETERMINISTIC PUSHDOWN RECOGNISERS 112 5.5.1 M
3D , A DETERMINISTIC VERSION OF M 3 113 5.5.2 MORE DETERMINISTIC PDRS
115 5.6 DETERMINISTIC AND NON-DETERMINISTIC CONTEXT FREE LANGUAGES 116
5.6.1 EVERY REGULAER LANGUAGE IS A DETERMINISTIC CFL 116 5.6.2 THE
NON-DETERMINISTIC CFLS 118 5.6.3 A REFMEMENT TO THE CHOMSKY HIERARCHY IN
THE CASE OF CFLS 120 5.7 THE EQUIVALENCE OF CFGS AND PDRS 121 5.8
OBSERVATIONS ON CONTEXT FREE GRAMMARS AND LANGUAGES . 121 6.
IMPORTANT FEATURES OF REGULAER AND CONTEXT FREE LANGUAGES 125 6.1
OVERVIEW 125 6.2 CLOSURE PROPERTIES OF LANGUAGES 126 6.3 CLOSURE
PROPERTIES OF THE REGULAER LANGUAGES 126 6.3.1 COMPLEMENT 126 6.3.2 UNION
128 6.3.3 INTERSECTION 129 6.3.4 CONCATENATION 131 6.4 CLOSURE
PROPERTIES OF THE CONTEXT FREE LANGUAGES 133 6.4.1 UNION 133 6.4.2
CONCATENATION 135 6.4.3 INTERSECTION 136 6.4.4 COMPLEMENT 137 6.5
CHOMSKY'S HIERARCH Y IS INDEED A PROPER HIERARCHY 138 6.5.1 THE "REPEAT
STATE THEOREM" 139 6.5.2 A LANGUAGE THAT IS CONTEXT FREE BUT NOT REGULAER
. 142 6.5.3 THE "UVWXY" THEOREM FOR CONTEXT FREE LANGUAGES 143 6.5.4
{A'&V:I 1} IS NOT CONTEXT FREE 150 6.5.5 THE "MULTIPLICATION LANGUAGE"
IS NOT CONTEXT FREE 151 6.6 PRELIMINARY OBSERVATIONS ON THE SCOPE OF THE
CHOMSKY HIERARCHY 153 7. PHRASE STRUCTURE LANGUAGES AND TURING MACHINES
155 7.1 OVERVIEW 155 7.2 THE ARCHITECTURE OF THE TURING MACHINE 155
7.2.1 "TAPES" AND THE "READ/WRITE HEAD" 156 7.2.2 BLANK SQUARES 157
7.2.3 TM "INSTRUCTIONS" 158 7.2.4 TURING MACHINES DEFINED 159 A CONCISE
INTRODUCTION TO LANGUAGES AND MACHINES 7.3 THE BEHAVIOUR OF A TM 159 7.4
TURING MACHINES AS LANGUAGE RECOGNISERS 163 7.4.1 REGULAER LANGUAGES 163
7.4.2 CONTEXT FREE LANGUAGES 164 7.4.3 TURING MACHINES ARE MORE POWERFUL
THANPDRS 166 7.5 INTRODUCTION TO (TURING MACHINE) COMPUTABLE LANGUAGES
169 7.6 THE TM AS THE RECOGNISER FOR THE CONTEXT SENSITIVE LANGUAGES 170
7.6.1 CONSTRUCTING A NON-DETERMINISTIC TM FOR REDUCTION PARSING OF A
CONTEXT SENSITIVE LANGUAGE 171 7.6.2 THE GENERALITY OF THE CONSTRUCTION
175 7.7 THE TM AS THE RECOGNISER FOR THE TYPE 0 LANGUAGES 177 7.7.1
AMENDING THE REDUCTION PARSING TM TO DEAL WITH TYPE 0 PRODUCTIONS 178
7.7.2 DEALING WITH THE EMPTY STRING 178 7.7.3 THE TM AS THE RECOGNISER
FOR ALI TYPES IN THE CHOMSKY HIERARCHY 181 7.8 DECIDABILITY: A
PRELIMINARY DISCUSSION 181 7.8.1 DECIDING A LANGUAGE 181 7.8.2 ACCEPTING
A LANGUAGE 183 7.9 END OF PART ONE 184 PART 2 MACHINES AND COMPUTATION
8. FINITE STATE TRANSDUCERS 189 8.1 OVERVIEW 189 8.2 FINITE STATE
TRANSDUCERS 189 8.3 FINITE STATE TRANSDUCERS AND LANGUAGE RECOGNITION
190 8.4 FINITE STATE TRANSDUCERS AND MEMORY 191 8.5 FINITE STATE
TRANSDUCERS AND COMPUTATION 194 8.5.1 SIMPLE MULTIPLICATION 194 8.5.2
ADDITION AND SUBTRACTION 195 8.5.3 SIMPLE DIVISION AND MODULAR
ARITHMETIC 199 8.6 THE LIMITATIONS OF THE FINITE STATE TRANSDUCER 200
8.6.1 RESTRICTED FST MULTIPLICATION 201 8.6.2 FSTS AND UNLIMITED
MULTIPLICATION 204 8.7 FSTS AS UNSUITABLE MODELS FOR REAL COMPUTERS 204
9. TURING MACHINES AS COMPUTERS 209 9.1 OVERVIEW 209 9.2 TURING MACHINES
AND COMPUTATION 209 CONTENTS 9.3 TURING MACHINES AND ARBITRARY BINARY
MULTIPLICATION 210 9.3.1 SOME BASIC TM OPERATIONS 210 9.3.2 THE "ADD" TM
212 9.3.3 THE "MULT" TM 215 9.4 TURING MACHINES AND ARBITRARY INTEGER
DIVISION 222 9.4.1 THE "SUBTRACT" TM 222 9.4.2 THE "DIV" TM 225 9.5
LOGICAL OPERATIONS 226 9.6 TMS AND THE SIMULATION OF COMPUTER OPERATIONS
229 10. TURING'S THESIS AND THE UNIVERSALITY OF THE TURING MACHINE 237
10.1 OVERVICW 237 10.2 TURING'S THESIS 238 10.3 CODING A TURING MACHINE
AND ITS TAPE A.S A BINARY NUMBER 240 10.3.1 CODING ANY TM 241 10.3.2
CODING THE TAPE 244 10.4 THE UNIVERSAL TURING MACHINE 244 10.4.1 UTAFS
TAPES 245 10.4.2 THE OPERATION OF UTM 246 10.4.3 SOME IMPLICATIONS OF
UTM 249 10.5 NON-DETERMINISTIC TMS 249 10.6 CONVERTING A
NON-DETERMINISTIC TM INTO A 4-TAPE DETERMINISTIC TM 250 10.6.1 THE FOUR
TAPES OF THE DETERMINIST IC MACHINE, D . . . . 251 10.6.2 THE SYSTEMATIC
GENERATION OF THE STRINGS OF QUINTUPLE LABELS 253 10.6.3 THE OPERATION
OF D 257 10.6.4 THE EQUIVALENCE OF NON-DETERMINISTIC TMS AND 4-TAPE
DETERMINISTIC TMS 260 10.7 CONVERTING A MULTI-TAPE TM INTO A SINGLE-TAPE
TM 261 10.7.1 EXAMPLE: REPRESENTING THREE TAPES AS ONE 263 10.7.2 THE
OPERATION OF THE SINGLE-TAPE MACHINE. 5 265 10.7.3 THE EQUIVALENCE OF
DETERMINISTIC MULTI-TAPE TMS AND DETERMINISTIC SINGLE-TAPE TMS 266 10.8
THE LINGUISTIC IMPLICATIONS OF THE EQUIVALENCE OF NON-DETERMINISTIC AND
DETERMINISTIC TMS 267 11. COMPUTABILITY, SOLVABILITY AND THE HALTING
PROBLEM 269 11.1 OVCRVIEW 269 11.2 THE RELATIONSHIP BETWEEN FUNCTIONS,
PROBLEMS. SOLVABILITY AND DECIDABILITY 270 11.2.1 FUNCTIONS AND
COMPUTABILITY 270 11.2.2 PROBLEMS AND SOLVABILITV 271 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Parkes, Alan P. 1955- |
| author_GND | (DE-588)1053186606 |
| author_facet | Parkes, Alan P. 1955- |
| author_role | aut |
| author_sort | Parkes, Alan P. 1955- |
| author_variant | a p p ap app |
| building | Verbundindex |
| bvnumber | BV023365332 |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)315659806 (DE-599)DNB985964138 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02003nam a2200493 c 4500</leader><controlfield tag="001">BV023365332</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230404 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080626s2008 xxka||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N44,0055</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">985964138</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848001206</subfield><subfield code="c">Pb. : ca. EUR 28.84 (freier Pr.), ca. sfr 47.00 (freier Pr.)</subfield><subfield code="9">978-1-84800-120-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1848001207</subfield><subfield code="c">Pb. : ca. EUR 28.84 (freier Pr.), ca. sfr 47.00 (freier Pr.)</subfield><subfield code="9">1-84800-120-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848001213</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-84800-121-3</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781848001206</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12123674</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)315659806</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB985964138</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">xxk</subfield><subfield code="c">XA-GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</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">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Parkes, Alan P.</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1053186606</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A concise introduction to languages and machines</subfield><subfield code="c">Alan P. Parkes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">[2008]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VII, 343 S.</subfield><subfield code="b">Illustrationen, Diagramme</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">Undergraduate topics in computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</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-84800-121-3</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">OEBV 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=016548699&sequence=000001&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-016548699</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV023365332 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:10:37Z |
| indexdate | 2024-07-09T21:16:56Z |
| institution | BVB |
| isbn | 9781848001206 1848001207 9781848001213 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016548699 |
| oclc_num | 315659806 |
| open_access_boolean | |
| owner | DE-20 DE-703 DE-521 DE-824 DE-706 DE-898 DE-BY-UBR DE-188 DE-11 |
| owner_facet | DE-20 DE-703 DE-521 DE-824 DE-706 DE-898 DE-BY-UBR DE-188 DE-11 |
| physical | VII, 343 S. Illustrationen, Diagramme |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| series2 | Undergraduate topics in computer science |
| spelling | Parkes, Alan P. 1955- Verfasser (DE-588)1053186606 aut A concise introduction to languages and machines Alan P. Parkes London Springer [2008] VII, 343 S. Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Undergraduate topics in computer science Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Formale Sprache (DE-588)4017848-1 s DE-604 Automatentheorie (DE-588)4003953-5 s Erscheint auch als Online-Ausgabe 978-1-84800-121-3 OEBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016548699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Parkes, Alan P. 1955- A concise introduction to languages and machines Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4017848-1 (DE-588)4151278-9 |
| title | A concise introduction to languages and machines |
| title_auth | A concise introduction to languages and machines |
| title_exact_search | A concise introduction to languages and machines |
| title_exact_search_txtP | A concise introduction to languages and machines |
| title_full | A concise introduction to languages and machines Alan P. Parkes |
| title_fullStr | A concise introduction to languages and machines Alan P. Parkes |
| title_full_unstemmed | A concise introduction to languages and machines Alan P. Parkes |
| title_short | A concise introduction to languages and machines |
| title_sort | a concise introduction to languages and machines |
| topic | Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Automatentheorie Formale Sprache Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016548699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT parkesalanp aconciseintroductiontolanguagesandmachines |