Verfügbarkeit: Automata and computability

Automata and computability:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Kozen, Dexter 1951- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	New York [u.a.] Springer 1997
Schriftenreihe:	Undergraduate texts in computer science
Schlagworte:	Computable functions Machine theory Turing-Maschine Endlicher Automat Kellerautomat Berechenbarkeit Automatentheorie Reguläre Menge Kontextfreie Grammatik
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	Hier auch später erschienene, unveränderte Nachdrucke
Beschreibung:	XIII, 400 S. graph. Darst.
ISBN:	0387949070

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV011380760
003	DE-604
005	20180628
007	t
008	970611s1997 d\|\|\| \|\|\|\| 00\|\|\| eng d
016	7		\|a 950822949 \|2 DE-101
020			\|a 0387949070 \|9 0-387-94907-0
035			\|a (OCoLC)247466015
035			\|a (DE-599)BVBBV011380760
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-20 \|a DE-739 \|a DE-703 \|a DE-355 \|a DE-29T \|a DE-473 \|a DE-634 \|a DE-83 \|a DE-11 \|a DE-19
050		0	\|a QA267
082	0		\|a 511.3
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 136 \|0 (DE-625)143591: \|2 rvk
100	1		\|a Kozen, Dexter \|d 1951- \|e Verfasser \|0 (DE-588)135740436 \|4 aut
245	1	0	\|a Automata and computability \|c Dexter C. Kozen
264		1	\|a New York [u.a.] \|b Springer \|c 1997
300			\|a XIII, 400 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Undergraduate texts in computer science
500			\|a Hier auch später erschienene, unveränderte Nachdrucke
650		4	\|a Computable functions
650		4	\|a Machine theory
650	0	7	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|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 Kellerautomat \|0 (DE-588)4325471-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Automatentheorie \|0 (DE-588)4003953-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Reguläre Menge \|0 (DE-588)4462639-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kontextfreie Grammatik \|0 (DE-588)4032281-6 \|2 gnd \|9 rswk-swf
689	0	0	\|a Automatentheorie \|0 (DE-588)4003953-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Endlicher Automat \|0 (DE-588)4224518-7 \|D s
689	1	1	\|a Reguläre Menge \|0 (DE-588)4462639-3 \|D s
689	1		\|5 DE-604
689	2	0	\|a Kellerautomat \|0 (DE-588)4325471-8 \|D s
689	2	1	\|a Kontextfreie Grammatik \|0 (DE-588)4032281-6 \|D s
689	2		\|5 DE-604
689	3	0	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|D s
689	3	1	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|D s
689	3		\|5 DE-604
856	4	2	\|m Digitalisierung UB Passau - ADAM Catalogue Enrichment \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007648480&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-007648480

Datensatz im Suchindex

_version_	1804125891515645952
adam_text	Contents Preface vii Lectures 1 Introduction 1 Course Roadmap and Historical Perspective............ 3 2 Strings and Sets .................................... 7 Finite Automata and Regular Sets 3 Finite Automata and Regular Sets................... 14 4 More on Regular Sets ............................... 19 5 Nondeterministic Finite Automata.................... 25 6 The Subset Construction............................ 32 7 Pattern Matching ................................... 40 8 Pattern Matching and Regular Expressions.......... . 44 9 Regular Expressions and Finite Automata............. 49 A Kleene Algebra and Regular Expressions.............. 55 TO Homomorphisms ...................................... 61 11 Limitations of Finite Automata...................... 67 12 Using the Pumping Lemma ............................ 72 13 DFA State Minimization.............................. 77 14 A Minimization Algorithm......................... 84 15 Myhill-Nerode Relations............................ 89 16 The Myhill-Nerode Theorem .......................... 95 B Collapsing Nondeterministic Automata......... C Automata on Terms............................ D The Myhill-Nerode Theorem for Term Automata 17 Two-Way Finite Automata.................... 18 2DFAs and Regular Sets..................... Pushdown Automata and Context-Free Languages 19 Context-Free Grammars and Languages........ 20 Balanced Parentheses ...................... 21 Normal Forms............................... 22 The Pumping Lemma for CFLs................. 23 Pushdown Automata.......................... E Final State Versus Empty Stack............... 24 PDAs and CFGs.............................. 25 Simulating NPDAs by CFGs .................. . F Deterministic Pushdown Automata.............. 26 Parsing.................................... 27 The Cocke-Kasami-Younger Algorithm......... G The Chomsky-Schiitzenberger Theorem.......... H Parikh’s Theorem.................. . . ...... Turing Machines and Effective Computability 28 Turing Machines and Effective Computability . . 29 More on Turing Machines.................... 30 Equivalent Models................. 31 Universal Machines and Diagonalization..... 32 Decidable and Undecidable Problems......... 33 Reduction.................................. 34 Rice’s Theorem . . . ...................... 35 Undecidable Problems About CFLs............ 36 Other Formalisms .......................... 37 The A-Calculus . .......................... I While Programs............................. J Beyond Undecidability ...................... 38 Gôdel’s Incompleteness Theorem............. 39 Proof of the Incompleteness Theorem ....... K Gôdel’s Proof................................ Exercises Homework Sets Homework 1 ...... ............................. Homework 2 . . ................................ Contents xiii Homework 3......................................... 303 Homework 4..........................................304 Homework 5..........................................306 Homework 6..........................................307 Homework 7..........................................308 Homework 8..........................................309 Homework 9..........................................310 Homework 10 ........................................311 Homework 11 ........................................312 Homework 12 ........................................313 Miscellaneous Exercises Finite Automata and Regular Sets....................315 Pushdown Automata and Context-Free Languages........333 Turing Machines and Effective Computability.........340 Hints and Solutions Hints for Selected Miscellaneous Exercises..........351 Solutions to Selected Miscellaneous Exercises.......357 References 373 Notation and Abbreviations 381 Index 389
any_adam_object	1
author	Kozen, Dexter 1951-
author_GND	(DE-588)135740436
author_facet	Kozen, Dexter 1951-
author_role	aut
author_sort	Kozen, Dexter 1951-
author_variant	d k dk
building	Verbundindex
bvnumber	BV011380760
callnumber-first	Q - Science
callnumber-label	QA267
callnumber-raw	QA267
callnumber-search	QA267
callnumber-sort	QA 3267
callnumber-subject	QA - Mathematics
classification_rvk	ST 130 ST 136
ctrlnum	(OCoLC)247466015 (DE-599)BVBBV011380760
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
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02386nam a2200589 c 4500</leader><controlfield tag="001">BV011380760</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180628 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970611s1997 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">950822949</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387949070</subfield><subfield code="9">0-387-94907-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247466015</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011380760</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="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</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">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">Kozen, Dexter</subfield><subfield code="d">1951-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135740436</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata and computability</subfield><subfield code="c">Dexter C. Kozen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 400 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="490" ind1="0" ind2=" "><subfield code="a">Undergraduate texts in computer science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</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">Kellerautomat</subfield><subfield code="0">(DE-588)4325471-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Reguläre Menge</subfield><subfield code="0">(DE-588)4462639-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kontextfreie Grammatik</subfield><subfield code="0">(DE-588)4032281-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Reguläre Menge</subfield><subfield code="0">(DE-588)4462639-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kellerautomat</subfield><subfield code="0">(DE-588)4325471-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Kontextfreie Grammatik</subfield><subfield code="0">(DE-588)4032281-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - 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=007648480&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-007648480</subfield></datafield></record></collection>
id	DE-604.BV011380760
illustrated	Illustrated
indexdate	2024-07-09T18:08:46Z
institution	BVB
isbn	0387949070
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-007648480
oclc_num	247466015
open_access_boolean
owner	DE-20 DE-739 DE-703 DE-355 DE-BY-UBR DE-29T DE-473 DE-BY-UBG DE-634 DE-83 DE-11 DE-19 DE-BY-UBM
owner_facet	DE-20 DE-739 DE-703 DE-355 DE-BY-UBR DE-29T DE-473 DE-BY-UBG DE-634 DE-83 DE-11 DE-19 DE-BY-UBM
physical	XIII, 400 S. graph. Darst.
publishDate	1997
publishDateSearch	1997
publishDateSort	1997
publisher	Springer
record_format	marc
series2	Undergraduate texts in computer science
spelling	Kozen, Dexter 1951- Verfasser (DE-588)135740436 aut Automata and computability Dexter C. Kozen New York [u.a.] Springer 1997 XIII, 400 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Undergraduate texts in computer science Hier auch später erschienene, unveränderte Nachdrucke Computable functions Machine theory Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Kellerautomat (DE-588)4325471-8 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Reguläre Menge (DE-588)4462639-3 gnd rswk-swf Kontextfreie Grammatik (DE-588)4032281-6 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s DE-604 Endlicher Automat (DE-588)4224518-7 s Reguläre Menge (DE-588)4462639-3 s Kellerautomat (DE-588)4325471-8 s Kontextfreie Grammatik (DE-588)4032281-6 s Turing-Maschine (DE-588)4203525-9 s Berechenbarkeit (DE-588)4138368-0 s Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007648480&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Kozen, Dexter 1951- Automata and computability Computable functions Machine theory Turing-Maschine (DE-588)4203525-9 gnd Endlicher Automat (DE-588)4224518-7 gnd Kellerautomat (DE-588)4325471-8 gnd Berechenbarkeit (DE-588)4138368-0 gnd Automatentheorie (DE-588)4003953-5 gnd Reguläre Menge (DE-588)4462639-3 gnd Kontextfreie Grammatik (DE-588)4032281-6 gnd
subject_GND	(DE-588)4203525-9 (DE-588)4224518-7 (DE-588)4325471-8 (DE-588)4138368-0 (DE-588)4003953-5 (DE-588)4462639-3 (DE-588)4032281-6
title	Automata and computability
title_auth	Automata and computability
title_exact_search	Automata and computability
title_full	Automata and computability Dexter C. Kozen
title_fullStr	Automata and computability Dexter C. Kozen
title_full_unstemmed	Automata and computability Dexter C. Kozen
title_short	Automata and computability
title_sort	automata and computability
topic	Computable functions Machine theory Turing-Maschine (DE-588)4203525-9 gnd Endlicher Automat (DE-588)4224518-7 gnd Kellerautomat (DE-588)4325471-8 gnd Berechenbarkeit (DE-588)4138368-0 gnd Automatentheorie (DE-588)4003953-5 gnd Reguläre Menge (DE-588)4462639-3 gnd Kontextfreie Grammatik (DE-588)4032281-6 gnd
topic_facet	Computable functions Machine theory Turing-Maschine Endlicher Automat Kellerautomat Berechenbarkeit Automatentheorie Reguläre Menge Kontextfreie Grammatik
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007648480&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT kozendexter automataandcomputability

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge