Verfügbarkeit: Introduction to automata theory, languages, and computation

Introduction to automata theory, languages, and computation:

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Hopcroft, John E. 1939- (VerfasserIn), Ullman, Jeffrey D. 1942- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Reading, Mass. Addison-Wesley 1979
Schriftenreihe:	Addison-Wesley series in computer science
Schlagworte:	Računalništvo Formale Sprache Berechenbarkeit Automatentheorie Theoretische Informatik Komplexitätstheorie Lehrbuch
Beschreibung:	X, 418 S. graph. Darst.
ISBN:	020102988X

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV001997743
003	DE-604
005	20160830
007	t
008	890928s1979 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 020102988X \|9 0-201-02988-X
035			\|a (OCoLC)439993758
035			\|a (DE-599)BVBBV001997743
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-12 \|a DE-91G \|a DE-384 \|a DE-703 \|a DE-739 \|a DE-898 \|a DE-355 \|a DE-20 \|a DE-29T \|a DE-29 \|a DE-19 \|a DE-634 \|a DE-83 \|a DE-11 \|a DE-188 \|a DE-706
080			\|a 51
084			\|a ST 110 \|0 (DE-625)143583: \|2 rvk
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 136 \|0 (DE-625)143591: \|2 rvk
084			\|a DAT 500f \|2 stub
084			\|a 68F10 \|2 msc
084			\|a 68D05 \|2 msc
084			\|a 68C25 \|2 msc
100	1		\|a Hopcroft, John E. \|d 1939- \|e Verfasser \|0 (DE-588)112071481 \|4 aut
245	1	0	\|a Introduction to automata theory, languages, and computation \|c John E. Hopcroft ; Jeffrey D. Ullman
264		1	\|a Reading, Mass. \|b Addison-Wesley \|c 1979
300			\|a X, 418 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a Addison-Wesley series in computer science
650		4	\|a Računalništvo
650	0	7	\|a Formale Sprache \|0 (DE-588)4017848-1 \|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 Theoretische Informatik \|0 (DE-588)4196735-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
655		7	\|8 1\p \|0 (DE-588)4123623-3 \|a Lehrbuch \|2 gnd-content
689	0	0	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Automatentheorie \|0 (DE-588)4003953-5 \|D s
689	1	1	\|a Formale Sprache \|0 (DE-588)4017848-1 \|D s
689	1	2	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	1	3	\|a Berechenbarkeit \|0 (DE-588)4138368-0 \|D s
689	1		\|8 2\p \|5 DE-604
700	1		\|a Ullman, Jeffrey D. \|d 1942- \|e Verfasser \|0 (DE-588)123598230 \|4 aut
999			\|a oai:aleph.bib-bvb.de:BVB01-001303131
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
980	4		\|a (DE-12)AK10080137
980	4		\|a (DE-12)AK22580858

Datensatz im Suchindex

_version_	1804116445047554048
any_adam_object
author	Hopcroft, John E. 1939- Ullman, Jeffrey D. 1942-
author_GND	(DE-588)112071481 (DE-588)123598230
author_facet	Hopcroft, John E. 1939- Ullman, Jeffrey D. 1942-
author_role	aut aut
author_sort	Hopcroft, John E. 1939-
author_variant	j e h je jeh j d u jd jdu
building	Verbundindex
bvnumber	BV001997743
classification_rvk	ST 110 ST 130 ST 136
classification_tum	DAT 500f
ctrlnum	(OCoLC)439993758 (DE-599)BVBBV001997743
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02313nam a2200589 c 4500</leader><controlfield tag="001">BV001997743</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160830 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1979 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">020102988X</subfield><subfield code="9">0-201-02988-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)439993758</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001997743</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-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="080" ind1=" " ind2=" "><subfield code="a">51</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 110</subfield><subfield code="0">(DE-625)143583:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68F10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68D05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68C25</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hopcroft, John E.</subfield><subfield code="d">1939-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)112071481</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to automata theory, languages, and computation</subfield><subfield code="c">John E. Hopcroft ; Jeffrey D. Ullman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1979</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 418 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">Addison-Wesley series in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Računalništvo</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="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">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ullman, Jeffrey D.</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123598230</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001303131</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><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK10080137</subfield></datafield><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK22580858</subfield></datafield></record></collection>
genre	1\p (DE-588)4123623-3 Lehrbuch gnd-content
genre_facet	Lehrbuch
id	DE-604.BV001997743
illustrated	Illustrated
indexdate	2024-07-09T15:38:37Z
institution	BVB
isbn	020102988X
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-001303131
oclc_num	439993758
open_access_boolean
owner	DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-20 DE-29T DE-29 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 DE-706
owner_facet	DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-20 DE-29T DE-29 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 DE-706
physical	X, 418 S. graph. Darst.
publishDate	1979
publishDateSearch	1979
publishDateSort	1979
publisher	Addison-Wesley
record_format	marc
series2	Addison-Wesley series in computer science
spelling	Hopcroft, John E. 1939- Verfasser (DE-588)112071481 aut Introduction to automata theory, languages, and computation John E. Hopcroft ; Jeffrey D. Ullman Reading, Mass. Addison-Wesley 1979 X, 418 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Addison-Wesley series in computer science Računalništvo Formale Sprache (DE-588)4017848-1 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf 1\p (DE-588)4123623-3 Lehrbuch gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s Komplexitätstheorie (DE-588)4120591-1 s Berechenbarkeit (DE-588)4138368-0 s 2\p DE-604 Ullman, Jeffrey D. 1942- Verfasser (DE-588)123598230 aut 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	Hopcroft, John E. 1939- Ullman, Jeffrey D. 1942- Introduction to automata theory, languages, and computation Računalništvo Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
subject_GND	(DE-588)4017848-1 (DE-588)4138368-0 (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4120591-1 (DE-588)4123623-3
title	Introduction to automata theory, languages, and computation
title_auth	Introduction to automata theory, languages, and computation
title_exact_search	Introduction to automata theory, languages, and computation
title_full	Introduction to automata theory, languages, and computation John E. Hopcroft ; Jeffrey D. Ullman
title_fullStr	Introduction to automata theory, languages, and computation John E. Hopcroft ; Jeffrey D. Ullman
title_full_unstemmed	Introduction to automata theory, languages, and computation John E. Hopcroft ; Jeffrey D. Ullman
title_short	Introduction to automata theory, languages, and computation
title_sort	introduction to automata theory languages and computation
topic	Računalništvo Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
topic_facet	Računalništvo Formale Sprache Berechenbarkeit Automatentheorie Theoretische Informatik Komplexitätstheorie Lehrbuch
work_keys_str_mv	AT hopcroftjohne introductiontoautomatatheorylanguagesandcomputation AT ullmanjeffreyd introductiontoautomatatheorylanguagesandcomputation

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge