Finite-state techniques: automata, transducers and bimachines
Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2019
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
60 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 29 Jul 2019) |
| Beschreibung: | 1 Online-Ressource (x, 304 Seiten) |
| ISBN: | 9781108756945 |
| DOI: | 10.1017/9781108756945 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046104550 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190814s2019 |||| o||u| ||||||eng d | ||
| 020 | |a 9781108756945 |c Online |9 978-1-108-75694-5 | ||
| 024 | 7 | |a 10.1017/9781108756945 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781108756945 | ||
| 035 | |a (OCoLC)1113309318 | ||
| 035 | |a (DE-599)BVBBV046104550 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 511.3/50285635 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Mihov, Stoyan |d 1968- |0 (DE-588)1192824709 |4 aut | |
| 245 | 1 | 0 | |a Finite-state techniques |b automata, transducers and bimachines |c Stoyan Mihov, Klaus U. Schulz |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2019 | |
| 300 | |a 1 Online-Ressource (x, 304 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science | |
| 490 | 0 | |a 60 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 29 Jul 2019) | ||
| 520 | |a Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice | ||
| 650 | 4 | |a Sequential machine theory | |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Schulz, Klaus |d 1957- |0 (DE-588)141112689 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-48541-8 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781108756945 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031485287 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/9781108756945 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781108756945 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804180414504370176 |
|---|---|
| any_adam_object | |
| author | Mihov, Stoyan 1968- Schulz, Klaus 1957- |
| author_GND | (DE-588)1192824709 (DE-588)141112689 |
| author_facet | Mihov, Stoyan 1968- Schulz, Klaus 1957- |
| author_role | aut aut |
| author_sort | Mihov, Stoyan 1968- |
| author_variant | s m sm k s ks |
| building | Verbundindex |
| bvnumber | BV046104550 |
| classification_rvk | ST 136 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781108756945 (OCoLC)1113309318 (DE-599)BVBBV046104550 |
| dewey-full | 511.3/50285635 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/50285635 |
| dewey-search | 511.3/50285635 |
| dewey-sort | 3511.3 850285635 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1017/9781108756945 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02976nmm a2200481zc 4500</leader><controlfield tag="001">BV046104550</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190814s2019 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108756945</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-75694-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108756945</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108756945</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1113309318</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046104550</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/50285635</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">Mihov, Stoyan</subfield><subfield code="d">1968-</subfield><subfield code="0">(DE-588)1192824709</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finite-state techniques</subfield><subfield code="b">automata, transducers and bimachines</subfield><subfield code="c">Stoyan Mihov, Klaus U. Schulz</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 304 Seiten)</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">Cambridge tracts in theoretical computer science</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">60</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 29 Jul 2019)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice</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">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="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=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schulz, Klaus</subfield><subfield code="d">1957-</subfield><subfield code="0">(DE-588)141112689</subfield><subfield code="4">aut</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">978-1-108-48541-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108756945</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031485287</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108756945</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108756945</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046104550 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:35:23Z |
| institution | BVB |
| isbn | 9781108756945 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031485287 |
| oclc_num | 1113309318 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 Online-Ressource (x, 304 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science 60 |
| spelling | Mihov, Stoyan 1968- (DE-588)1192824709 aut Finite-state techniques automata, transducers and bimachines Stoyan Mihov, Klaus U. Schulz Cambridge Cambridge University Press 2019 1 Online-Ressource (x, 304 Seiten) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 60 Title from publisher's bibliographic system (viewed on 29 Jul 2019) Finite-state methods are the most efficient mechanisms for analysing textual and symbolic data, providing elegant solutions for an immense number of practical problems in computational linguistics and computer science. This book for graduate students and researchers gives a complete coverage of the field, starting from a conceptual introduction and building to advanced topics and applications. The central finite-state technologies are introduced with mathematical rigour, ranging from simple finite-state automata to transducers and bimachines as 'input-output' devices. Special attention is given to the rich possibilities of simplifying, transforming and combining finite-state devices. All algorithms presented are accompanied by full correctness proofs and executable source code in a new programming language, C(M), which focuses on transparency of steps and simplicity of code. Thus, by enabling readers to obtain a deep formal understanding of the subject and to put finite-state methods to real use, this book closes the gap between theory and practice Sequential machine theory Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Endlicher Automat (DE-588)4224518-7 s 1\p DE-604 Schulz, Klaus 1957- (DE-588)141112689 aut Erscheint auch als Druck-Ausgabe 978-1-108-48541-8 https://doi.org/10.1017/9781108756945 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Mihov, Stoyan 1968- Schulz, Klaus 1957- Finite-state techniques automata, transducers and bimachines Sequential machine theory Endlicher Automat (DE-588)4224518-7 gnd |
| subject_GND | (DE-588)4224518-7 |
| title | Finite-state techniques automata, transducers and bimachines |
| title_auth | Finite-state techniques automata, transducers and bimachines |
| title_exact_search | Finite-state techniques automata, transducers and bimachines |
| title_full | Finite-state techniques automata, transducers and bimachines Stoyan Mihov, Klaus U. Schulz |
| title_fullStr | Finite-state techniques automata, transducers and bimachines Stoyan Mihov, Klaus U. Schulz |
| title_full_unstemmed | Finite-state techniques automata, transducers and bimachines Stoyan Mihov, Klaus U. Schulz |
| title_short | Finite-state techniques |
| title_sort | finite state techniques automata transducers and bimachines |
| title_sub | automata, transducers and bimachines |
| topic | Sequential machine theory Endlicher Automat (DE-588)4224518-7 gnd |
| topic_facet | Sequential machine theory Endlicher Automat |
| url | https://doi.org/10.1017/9781108756945 |
| work_keys_str_mv | AT mihovstoyan finitestatetechniquesautomatatransducersandbimachines AT schulzklaus finitestatetechniquesautomatatransducersandbimachines |