Automata Theory and its Applications:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Birkhäuser Boston
2001
|
| Schriftenreihe: | Progress in Computer Science and Applied Logic
21 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata |
| Beschreibung: | 1 Online-Ressource (XIV, 432 p) |
| ISBN: | 9781461201717 9781461266457 |
| DOI: | 10.1007/978-1-4612-0171-7 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042419465 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461201717 |c Online |9 978-1-4612-0171-7 | ||
| 020 | |a 9781461266457 |c Print |9 978-1-4612-6645-7 | ||
| 024 | 7 | |a 10.1007/978-1-4612-0171-7 |2 doi | |
| 035 | |a (OCoLC)1184268176 | ||
| 035 | |a (DE-599)BVBBV042419465 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 511.3 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Khoussainov, Bakhadyr |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automata Theory and its Applications |c by Bakhadyr Khoussainov, Anil Nerode |
| 264 | 1 | |a Boston, MA |b Birkhäuser Boston |c 2001 | |
| 300 | |a 1 Online-Ressource (XIV, 432 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Progress in Computer Science and Applied Logic |v 21 | |
| 500 | |a The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Software engineering | |
| 650 | 4 | |a Information theory | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Mathematical Logic and Foundations | |
| 650 | 4 | |a Artificial Intelligence (incl. Robotics) | |
| 650 | 4 | |a Software Engineering/Programming and Operating Systems | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |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 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Nerode, Anil |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4612-0171-7 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027854882 | ||
| 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_ | 1804153090133196800 |
|---|---|
| any_adam_object | |
| author | Khoussainov, Bakhadyr |
| author_facet | Khoussainov, Bakhadyr |
| author_role | aut |
| author_sort | Khoussainov, Bakhadyr |
| author_variant | b k bk |
| building | Verbundindex |
| bvnumber | BV042419465 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184268176 (DE-599)BVBBV042419465 |
| 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 | Mathematik |
| doi_str_mv | 10.1007/978-1-4612-0171-7 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03834nmm a2200649zcb4500</leader><controlfield tag="001">BV042419465</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461201717</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4612-0171-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461266457</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4612-6645-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4612-0171-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184268176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042419465</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Khoussainov, Bakhadyr</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata Theory and its Applications</subfield><subfield code="c">by Bakhadyr Khoussainov, Anil Nerode</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Birkhäuser Boston</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 432 p)</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="490" ind1="0" ind2=" "><subfield code="a">Progress in Computer Science and Applied Logic</subfield><subfield code="v">21</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Foundations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence (incl. Robotics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering/Programming and Operating Systems</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">Computation by Abstract Devices</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">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</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">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="8">1\p</subfield><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=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nerode, Anil</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4612-0171-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027854882</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.BV042419465 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:04Z |
| institution | BVB |
| isbn | 9781461201717 9781461266457 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027854882 |
| oclc_num | 1184268176 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XIV, 432 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Birkhäuser Boston |
| record_format | marc |
| series2 | Progress in Computer Science and Applied Logic |
| spelling | Khoussainov, Bakhadyr Verfasser aut Automata Theory and its Applications by Bakhadyr Khoussainov, Anil Nerode Boston, MA Birkhäuser Boston 2001 1 Online-Ressource (XIV, 432 p) txt rdacontent c rdamedia cr rdacarrier Progress in Computer Science and Applied Logic 21 The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata Mathematics Software engineering Information theory Computer science Artificial intelligence Logic, Symbolic and mathematical Mathematical Logic and Foundations Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Theory of Computation Computation by Abstract Devices Mathematical Logic and Formal Languages Informatik Künstliche Intelligenz Mathematik Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s 1\p DE-604 Endlicher Automat (DE-588)4224518-7 s 2\p DE-604 Nerode, Anil Sonstige oth https://doi.org/10.1007/978-1-4612-0171-7 Verlag Volltext 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 | Khoussainov, Bakhadyr Automata Theory and its Applications Mathematics Software engineering Information theory Computer science Artificial intelligence Logic, Symbolic and mathematical Mathematical Logic and Foundations Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Theory of Computation Computation by Abstract Devices Mathematical Logic and Formal Languages Informatik Künstliche Intelligenz Mathematik Endlicher Automat (DE-588)4224518-7 gnd Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4224518-7 (DE-588)4003953-5 |
| title | Automata Theory and its Applications |
| title_auth | Automata Theory and its Applications |
| title_exact_search | Automata Theory and its Applications |
| title_full | Automata Theory and its Applications by Bakhadyr Khoussainov, Anil Nerode |
| title_fullStr | Automata Theory and its Applications by Bakhadyr Khoussainov, Anil Nerode |
| title_full_unstemmed | Automata Theory and its Applications by Bakhadyr Khoussainov, Anil Nerode |
| title_short | Automata Theory and its Applications |
| title_sort | automata theory and its applications |
| topic | Mathematics Software engineering Information theory Computer science Artificial intelligence Logic, Symbolic and mathematical Mathematical Logic and Foundations Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Theory of Computation Computation by Abstract Devices Mathematical Logic and Formal Languages Informatik Künstliche Intelligenz Mathematik Endlicher Automat (DE-588)4224518-7 gnd Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | Mathematics Software engineering Information theory Computer science Artificial intelligence Logic, Symbolic and mathematical Mathematical Logic and Foundations Artificial Intelligence (incl. Robotics) Software Engineering/Programming and Operating Systems Theory of Computation Computation by Abstract Devices Mathematical Logic and Formal Languages Informatik Künstliche Intelligenz Mathematik Endlicher Automat Automatentheorie |
| url | https://doi.org/10.1007/978-1-4612-0171-7 |
| work_keys_str_mv | AT khoussainovbakhadyr automatatheoryanditsapplications AT nerodeanil automatatheoryanditsapplications |