Theory of finite automata: with an introduction to formal languages
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Englewood Cliffs, NJ
Prentice Hall
1989
|
| Series: | Prentice-Hall international editions
|
| Subjects: | |
| Physical Description: | VIII, 438 S. Ill., graph. Darst. |
| ISBN: | 0139137084 0139138153 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV005559275 | ||
| 003 | DE-604 | ||
| 005 | 20050224 | ||
| 007 | t| | ||
| 008 | 920915s1989 xx ad|| |||| 00||| eng d | ||
| 020 | |a 0139137084 |9 0-13-913708-4 | ||
| 020 | |a 0139138153 |9 0-13-913815-3 | ||
| 035 | |a (OCoLC)18259850 | ||
| 035 | |a (DE-599)BVBBV005559275 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-29T |a DE-19 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA267.5.S4 | |
| 082 | 0 | |a 511 |2 19 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Carroll, John |d 1944- |e Verfasser |0 (DE-588)170271080 |4 aut | |
| 245 | 1 | 0 | |a Theory of finite automata |b with an introduction to formal languages |c John Carroll ; Darrell Long |
| 264 | 1 | |a Englewood Cliffs, NJ |b Prentice Hall |c 1989 | |
| 300 | |a VIII, 438 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Prentice-Hall international editions | |
| 650 | 7 | |a Langages formels |2 ram | |
| 650 | 7 | |a Machines séquentielles, Théorie des |2 ram | |
| 650 | 7 | |a automate fini |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a langage algébrique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Sequential machine theory | |
| 650 | 0 | 7 | |a Computerarchitektur |0 (DE-588)4048717-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-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 Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitungssystem |0 (DE-588)4125229-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Leistungsbewertung |0 (DE-588)4167271-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematisches Modell |0 (DE-588)4114528-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theorie |0 (DE-588)4059787-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143389-0 |a Aufgabensammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 0 | 1 | |a Theorie |0 (DE-588)4059787-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computerarchitektur |0 (DE-588)4048717-9 |D s |
| 689 | 1 | 1 | |a Mathematisches Modell |0 (DE-588)4114528-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 2 | 1 | |a Leistungsbewertung |0 (DE-588)4167271-9 |D s |
| 689 | 2 | 2 | |a Datenverarbeitungssystem |0 (DE-588)4125229-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 3 | |8 2\p |5 DE-604 | |
| 689 | 4 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 4 | |8 3\p |5 DE-604 | |
| 700 | 1 | |a Long, Darrell D. |e Verfasser |4 aut | |
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-003485582 | |
Record in the Search Index
| _version_ | 1818947720543469568 |
|---|---|
| any_adam_object | |
| author | Carroll, John 1944- Long, Darrell D. |
| author_GND | (DE-588)170271080 |
| author_facet | Carroll, John 1944- Long, Darrell D. |
| author_role | aut aut |
| author_sort | Carroll, John 1944- |
| author_variant | j c jc d d l dd ddl |
| building | Verbundindex |
| bvnumber | BV005559275 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.5.S4 |
| callnumber-search | QA267.5.S4 |
| callnumber-sort | QA 3267.5 S4 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 136 |
| ctrlnum | (OCoLC)18259850 (DE-599)BVBBV005559275 |
| dewey-full | 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511 |
| dewey-search | 511 |
| dewey-sort | 3511 |
| 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>03060nam a2200769 c 4500</leader><controlfield tag="001">BV005559275</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050224 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">920915s1989 xx ad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0139137084</subfield><subfield code="9">0-13-913708-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0139138153</subfield><subfield code="9">0-13-913815-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)18259850</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV005559275</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-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.5.S4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511</subfield><subfield code="2">19</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">Carroll, John</subfield><subfield code="d">1944-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)170271080</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of finite automata</subfield><subfield code="b">with an introduction to formal languages</subfield><subfield code="c">John Carroll ; Darrell Long</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Englewood Cliffs, NJ</subfield><subfield code="b">Prentice Hall</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 438 S.</subfield><subfield code="b">Ill., 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">Prentice-Hall international editions</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Langages formels</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machines séquentielles, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automate fini</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage algébrique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerarchitektur</subfield><subfield code="0">(DE-588)4048717-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-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">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">Datenverarbeitungssystem</subfield><subfield code="0">(DE-588)4125229-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</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="650" ind1="0" ind2="7"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theorie</subfield><subfield code="0">(DE-588)4059787-8</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)4143389-0</subfield><subfield code="a">Aufgabensammlung</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">Theorie</subfield><subfield code="0">(DE-588)4059787-8</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">Computerarchitektur</subfield><subfield code="0">(DE-588)4048717-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</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">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Datenverarbeitungssystem</subfield><subfield code="0">(DE-588)4125229-9</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</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="689" ind1="4" 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="4" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Long, Darrell D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="883" ind1="1" ind2=" "><subfield code="8">3\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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-003485582</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content |
| genre_facet | Aufgabensammlung |
| id | DE-604.BV005559275 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T08:35:23Z |
| institution | BVB |
| isbn | 0139137084 0139138153 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-003485582 |
| oclc_num | 18259850 |
| open_access_boolean | |
| owner | DE-739 DE-29T DE-19 DE-BY-UBM DE-83 DE-188 |
| owner_facet | DE-739 DE-29T DE-19 DE-BY-UBM DE-83 DE-188 |
| physical | VIII, 438 S. Ill., graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Prentice Hall |
| record_format | marc |
| series2 | Prentice-Hall international editions |
| spelling | Carroll, John 1944- Verfasser (DE-588)170271080 aut Theory of finite automata with an introduction to formal languages John Carroll ; Darrell Long Englewood Cliffs, NJ Prentice Hall 1989 VIII, 438 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Prentice-Hall international editions Langages formels ram Machines séquentielles, Théorie des ram automate fini inriac décidabilité inriac langage algébrique inriac langage formel inriac machine Turing inriac Formal languages Sequential machine theory Computerarchitektur (DE-588)4048717-9 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Datenverarbeitungssystem (DE-588)4125229-9 gnd rswk-swf Leistungsbewertung (DE-588)4167271-9 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Theorie (DE-588)4059787-8 gnd rswk-swf 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content Endlicher Automat (DE-588)4224518-7 s Theorie (DE-588)4059787-8 s DE-604 Computerarchitektur (DE-588)4048717-9 s Mathematisches Modell (DE-588)4114528-8 s Warteschlangentheorie (DE-588)4255044-0 s Leistungsbewertung (DE-588)4167271-9 s Datenverarbeitungssystem (DE-588)4125229-9 s Automatentheorie (DE-588)4003953-5 s 2\p DE-604 Formale Sprache (DE-588)4017848-1 s 3\p DE-604 Long, Darrell D. Verfasser 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Carroll, John 1944- Long, Darrell D. Theory of finite automata with an introduction to formal languages Langages formels ram Machines séquentielles, Théorie des ram automate fini inriac décidabilité inriac langage algébrique inriac langage formel inriac machine Turing inriac Formal languages Sequential machine theory Computerarchitektur (DE-588)4048717-9 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Datenverarbeitungssystem (DE-588)4125229-9 gnd Leistungsbewertung (DE-588)4167271-9 gnd Formale Sprache (DE-588)4017848-1 gnd Mathematisches Modell (DE-588)4114528-8 gnd Theorie (DE-588)4059787-8 gnd |
| subject_GND | (DE-588)4048717-9 (DE-588)4255044-0 (DE-588)4003953-5 (DE-588)4224518-7 (DE-588)4125229-9 (DE-588)4167271-9 (DE-588)4017848-1 (DE-588)4114528-8 (DE-588)4059787-8 (DE-588)4143389-0 |
| title | Theory of finite automata with an introduction to formal languages |
| title_auth | Theory of finite automata with an introduction to formal languages |
| title_exact_search | Theory of finite automata with an introduction to formal languages |
| title_full | Theory of finite automata with an introduction to formal languages John Carroll ; Darrell Long |
| title_fullStr | Theory of finite automata with an introduction to formal languages John Carroll ; Darrell Long |
| title_full_unstemmed | Theory of finite automata with an introduction to formal languages John Carroll ; Darrell Long |
| title_short | Theory of finite automata |
| title_sort | theory of finite automata with an introduction to formal languages |
| title_sub | with an introduction to formal languages |
| topic | Langages formels ram Machines séquentielles, Théorie des ram automate fini inriac décidabilité inriac langage algébrique inriac langage formel inriac machine Turing inriac Formal languages Sequential machine theory Computerarchitektur (DE-588)4048717-9 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Automatentheorie (DE-588)4003953-5 gnd Endlicher Automat (DE-588)4224518-7 gnd Datenverarbeitungssystem (DE-588)4125229-9 gnd Leistungsbewertung (DE-588)4167271-9 gnd Formale Sprache (DE-588)4017848-1 gnd Mathematisches Modell (DE-588)4114528-8 gnd Theorie (DE-588)4059787-8 gnd |
| topic_facet | Langages formels Machines séquentielles, Théorie des automate fini décidabilité langage algébrique langage formel machine Turing Formal languages Sequential machine theory Computerarchitektur Warteschlangentheorie Automatentheorie Endlicher Automat Datenverarbeitungssystem Leistungsbewertung Formale Sprache Mathematisches Modell Theorie Aufgabensammlung |
| work_keys_str_mv | AT carrolljohn theoryoffiniteautomatawithanintroductiontoformallanguages AT longdarrelld theoryoffiniteautomatawithanintroductiontoformallanguages |