Automata and Languages: Theory and Applications
Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses b...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London
Springer London
2000
|
| Ausgabe: | 1st ed. 2000 |
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- * basic models of computation * formal languages and their properties * computability, decidability and complexity * a discussion of the modern trends in the theory of automata and formal languages * design of programming languages, including the development of a new programming language * compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science |
| Beschreibung: | 1 Online-Ressource (XVI, 920 p. 32 illus) |
| ISBN: | 9781447105015 |
| DOI: | 10.1007/978-1-4471-0501-5 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064769 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781447105015 |9 978-1-4471-0501-5 | ||
| 024 | 7 | |a 10.1007/978-1-4471-0501-5 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-4471-0501-5 | ||
| 035 | |a (OCoLC)1227480877 | ||
| 035 | |a (DE-599)BVBBV047064769 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Meduna, Alexander |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automata and Languages |b Theory and Applications |c by Alexander Meduna |
| 250 | |a 1st ed. 2000 | ||
| 264 | 1 | |a London |b Springer London |c 2000 | |
| 300 | |a 1 Online-Ressource (XVI, 920 p. 32 illus) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- * basic models of computation * formal languages and their properties * computability, decidability and complexity * a discussion of the modern trends in the theory of automata and formal languages * design of programming languages, including the development of a new programming language * compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science | ||
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Logics and Meanings of Programs | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer logic | |
| 650 | 4 | |a Mathematical logic | |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerlinguistik |0 (DE-588)4035843-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |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 Computerlinguistik |0 (DE-588)4035843-4 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781852330743 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781447105022 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4471-0501-5 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471880 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4471-0501-5 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182063225503744 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Meduna, Alexander |
| author_facet | Meduna, Alexander |
| author_role | aut |
| author_sort | Meduna, Alexander |
| author_variant | a m am |
| building | Verbundindex |
| bvnumber | BV047064769 |
| classification_rvk | ST 130 ST 136 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-1-4471-0501-5 (OCoLC)1227480877 (DE-599)BVBBV047064769 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-1-4471-0501-5 |
| edition | 1st ed. 2000 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03428nmm a2200649zc 4500</leader><controlfield tag="001">BV047064769</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447105015</subfield><subfield code="9">978-1-4471-0501-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4471-0501-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4471-0501-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227480877</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064769</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</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">Meduna, Alexander</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata and Languages</subfield><subfield code="b">Theory and Applications</subfield><subfield code="c">by Alexander Meduna</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVI, 920 p. 32 illus)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- * basic models of computation * formal languages and their properties * computability, decidability and complexity * a discussion of the modern trends in the theory of automata and formal languages * design of programming languages, including the development of a new programming language * compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logics and Meanings of Programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</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">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</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="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">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</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">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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">Druck-Ausgabe</subfield><subfield code="z">9781852330743</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781447105022</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4471-0501-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471880</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-0501-5</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064769 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9781447105015 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471880 |
| oclc_num | 1227480877 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVI, 920 p. 32 illus) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer London |
| record_format | marc |
| spelling | Meduna, Alexander Verfasser aut Automata and Languages Theory and Applications by Alexander Meduna 1st ed. 2000 London Springer London 2000 1 Online-Ressource (XVI, 920 p. 32 illus) txt rdacontent c rdamedia cr rdacarrier Automata and Languages presents a step-by-step development of the theory of automata, languages and computation. Intended to be used as the basis of an introductory course to this theory at both junior and senior levels, the text is organized in such a way as to allow the design of various courses based on selected material. Areas featured in the book include:- * basic models of computation * formal languages and their properties * computability, decidability and complexity * a discussion of the modern trends in the theory of automata and formal languages * design of programming languages, including the development of a new programming language * compiler design, including the construction of a complete compiler Alexander Meduna uses clear definitions, easy-to-follow proofs and helpful examples to make formerly obscure concepts easy to understand. He also includes challenging exercises and programming projects to enhance the reader's comprehension, and, to put the theory firmly into a 'real world' context, he presents lots of realistic illustrations and applications in practical computer science Theory of Computation Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Computers Artificial intelligence Algorithms Computer logic Mathematical logic Formale Sprache (DE-588)4017848-1 gnd rswk-swf Computerlinguistik (DE-588)4035843-4 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s DE-604 Computerlinguistik (DE-588)4035843-4 s Formale Sprache (DE-588)4017848-1 s Erscheint auch als Druck-Ausgabe 9781852330743 Erscheint auch als Druck-Ausgabe 9781447105022 https://doi.org/10.1007/978-1-4471-0501-5 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Meduna, Alexander Automata and Languages Theory and Applications Theory of Computation Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Computers Artificial intelligence Algorithms Computer logic Mathematical logic Formale Sprache (DE-588)4017848-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4035843-4 (DE-588)4003953-5 |
| title | Automata and Languages Theory and Applications |
| title_auth | Automata and Languages Theory and Applications |
| title_exact_search | Automata and Languages Theory and Applications |
| title_exact_search_txtP | Automata and Languages Theory and Applications |
| title_full | Automata and Languages Theory and Applications by Alexander Meduna |
| title_fullStr | Automata and Languages Theory and Applications by Alexander Meduna |
| title_full_unstemmed | Automata and Languages Theory and Applications by Alexander Meduna |
| title_short | Automata and Languages |
| title_sort | automata and languages theory and applications |
| title_sub | Theory and Applications |
| topic | Theory of Computation Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Computers Artificial intelligence Algorithms Computer logic Mathematical logic Formale Sprache (DE-588)4017848-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | Theory of Computation Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Computers Artificial intelligence Algorithms Computer logic Mathematical logic Formale Sprache Computerlinguistik Automatentheorie |
| url | https://doi.org/10.1007/978-1-4471-0501-5 |
| work_keys_str_mv | AT medunaalexander automataandlanguagestheoryandapplications |