Automata and computability:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
New York [u.a.]
Springer
2007
|
Ausgabe: | 1. ed., 9., pr. |
Schriftenreihe: | Undergraduate texts in computer science
|
Schlagworte: | |
Beschreibung: | XIII, 400 S. graph. Darst. |
ISBN: | 0387949070 9780387949079 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV025463971 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 100417s2007 d||| |||| 00||| eng d | ||
020 | |a 0387949070 |9 0-387-94907-0 | ||
020 | |a 9780387949079 |9 978-0-387-94907-9 | ||
035 | |a (OCoLC)890541189 | ||
035 | |a (DE-599)BVBBV025463971 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-11 | ||
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 C. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Automata and computability |c Dexter C. Kozen |
250 | |a 1. ed., 9., pr. | ||
264 | 1 | |a New York [u.a.] |b Springer |c 2007 | |
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 | |
650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kellerautomat |0 (DE-588)4325471-8 |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 Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kontextfreie Grammatik |0 (DE-588)4032281-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Reguläre Menge |0 (DE-588)4462639-3 |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 Turing-Maschine |0 (DE-588)4203525-9 |D s |
689 | 2 | 1 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
689 | 2 | |8 1\p |5 DE-604 | |
689 | 3 | 0 | |a Kellerautomat |0 (DE-588)4325471-8 |D s |
689 | 3 | 1 | |a Kontextfreie Grammatik |0 (DE-588)4032281-6 |D s |
689 | 3 | |8 2\p |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-020079673 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804142624582402048 |
---|---|
any_adam_object | |
author | Kozen, Dexter C. |
author_facet | Kozen, Dexter C. |
author_role | aut |
author_sort | Kozen, Dexter C. |
author_variant | d c k dc dck |
building | Verbundindex |
bvnumber | BV025463971 |
classification_rvk | ST 130 ST 136 |
ctrlnum | (OCoLC)890541189 (DE-599)BVBBV025463971 |
discipline | Informatik |
edition | 1. ed., 9., pr. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02058nam a2200553 c 4500</leader><controlfield tag="001">BV025463971</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s2007 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387949070</subfield><subfield code="9">0-387-94907-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387949079</subfield><subfield code="9">978-0-387-94907-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)890541189</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025463971</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="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 C.</subfield><subfield code="e">Verfasser</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="250" ind1=" " ind2=" "><subfield code="a">1. ed., 9., pr.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2007</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="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">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">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">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">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="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">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="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">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" 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="3" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020079673</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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.BV025463971 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:34:44Z |
institution | BVB |
isbn | 0387949070 9780387949079 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020079673 |
oclc_num | 890541189 |
open_access_boolean | |
owner | DE-11 |
owner_facet | DE-11 |
physical | XIII, 400 S. graph. Darst. |
publishDate | 2007 |
publishDateSearch | 2007 |
publishDateSort | 2007 |
publisher | Springer |
record_format | marc |
series2 | Undergraduate texts in computer science |
spelling | Kozen, Dexter C. Verfasser aut Automata and computability Dexter C. Kozen 1. ed., 9., pr. New York [u.a.] Springer 2007 XIII, 400 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Undergraduate texts in computer science Automatentheorie (DE-588)4003953-5 gnd rswk-swf Kellerautomat (DE-588)4325471-8 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Kontextfreie Grammatik (DE-588)4032281-6 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Reguläre Menge (DE-588)4462639-3 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 Turing-Maschine (DE-588)4203525-9 s Berechenbarkeit (DE-588)4138368-0 s 1\p DE-604 Kellerautomat (DE-588)4325471-8 s Kontextfreie Grammatik (DE-588)4032281-6 s 2\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Kozen, Dexter C. Automata and computability Automatentheorie (DE-588)4003953-5 gnd Kellerautomat (DE-588)4325471-8 gnd Endlicher Automat (DE-588)4224518-7 gnd Turing-Maschine (DE-588)4203525-9 gnd Kontextfreie Grammatik (DE-588)4032281-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd Reguläre Menge (DE-588)4462639-3 gnd |
subject_GND | (DE-588)4003953-5 (DE-588)4325471-8 (DE-588)4224518-7 (DE-588)4203525-9 (DE-588)4032281-6 (DE-588)4138368-0 (DE-588)4462639-3 |
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 | Automatentheorie (DE-588)4003953-5 gnd Kellerautomat (DE-588)4325471-8 gnd Endlicher Automat (DE-588)4224518-7 gnd Turing-Maschine (DE-588)4203525-9 gnd Kontextfreie Grammatik (DE-588)4032281-6 gnd Berechenbarkeit (DE-588)4138368-0 gnd Reguläre Menge (DE-588)4462639-3 gnd |
topic_facet | Automatentheorie Kellerautomat Endlicher Automat Turing-Maschine Kontextfreie Grammatik Berechenbarkeit Reguläre Menge |
work_keys_str_mv | AT kozendexterc automataandcomputability |