Jumping computation updating automata and grammars for discontinuous information processing
Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a pra...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Boca Raton
CRC Press
2024
|
Schlagworte: | |
Online-Zugang: | lizenzpflichtig |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
LEADER | 00000cam a22000002 4500 | ||
---|---|---|---|
001 | ZDB-30-ORH-104368195 | ||
003 | DE-627-1 | ||
005 | 20241001123236.0 | ||
007 | cr uuu---uuuuu | ||
008 | 240701s2024 xx |||||o 00| ||eng c | ||
020 | |a 9781003107910 |c ebook |9 978-1-003-10791-0 | ||
020 | |a 1003107915 |9 1-003-10791-5 | ||
020 | |a 9781003852544 |c electronic bk. : PDF |9 978-1-003-85254-4 | ||
020 | |a 1003852548 |c electronic bk. : PDF |9 1-003-85254-8 | ||
020 | |a 9781003852605 |c electronic bk. : EPUB |9 978-1-003-85260-5 | ||
020 | |a 1003852602 |c electronic bk. : EPUB |9 1-003-85260-2 | ||
035 | |a (DE-627-1)104368195 | ||
035 | |a (DE-599)KEP104368195 | ||
035 | |a (ORHE)9781003852605 | ||
035 | |a (DE-627-1)104368195 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
072 | 7 | |a COM |2 bisacsh | |
072 | 7 | |a COM |2 bisacsh | |
072 | 7 | |a COM |2 bisacsh | |
072 | 7 | |a UB |2 bicssc | |
082 | 0 | |a 004 |2 23/eng/20240830 | |
100 | 1 | |a Meduna, Alexander |d 1957- |e VerfasserIn |4 aut | |
245 | 1 | 0 | |a Jumping computation |b updating automata and grammars for discontinuous information processing |c Alexander Meduna, Zbyněk Křivka |
263 | |a 2404 | ||
264 | 1 | |a Boca Raton |b CRC Press |c 2024 | |
300 | |a 1 online resource | ||
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
500 | |a Includes bibliographical references and index. - Description based on print version record and CIP data provided by publisher; resource not viewed | ||
520 | |a Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars. In today⁰́₉s computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, today⁰́₉s computational methods frequently process information in a fundamentally different way, frequently ⁰́₋jumping⁰́₊ over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the words they work on. The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics. | ||
650 | 0 | |a Machine theory | |
650 | 0 | |a Computer science |x Mathematics | |
650 | 0 | |a Computer programming | |
650 | 4 | |a Théorie des automates | |
650 | 4 | |a Informatique ; Mathématiques | |
650 | 4 | |a Algorithmes | |
650 | 4 | |a Programmation (Informatique) | |
650 | 4 | |a algorithms | |
650 | 4 | |a computer programming | |
650 | 4 | |a COMPUTERS / General | |
650 | 4 | |a COMPUTERS / Artificial Intelligence | |
650 | 4 | |a COMPUTERS / Computer Graphics / Game Programming & Design | |
700 | 1 | |a Křivka, Zbyněk |e VerfasserIn |4 aut | |
776 | 1 | |z 9780367620936 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780367620936 |
856 | 4 | 0 | |l TUM01 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781003852605/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
912 | |a ZDB-30-ORH | ||
951 | |a BO | ||
912 | |a ZDB-30-ORH | ||
049 | |a DE-91 |
Datensatz im Suchindex
DE-BY-TUM_katkey | ZDB-30-ORH-104368195 |
---|---|
_version_ | 1818767368412725248 |
adam_text | |
any_adam_object | |
author | Meduna, Alexander 1957- Křivka, Zbyněk |
author_facet | Meduna, Alexander 1957- Křivka, Zbyněk |
author_role | aut aut |
author_sort | Meduna, Alexander 1957- |
author_variant | a m am z k zk |
building | Verbundindex |
bvnumber | localTUM |
collection | ZDB-30-ORH |
ctrlnum | (DE-627-1)104368195 (DE-599)KEP104368195 (ORHE)9781003852605 |
dewey-full | 004 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004 |
dewey-search | 004 |
dewey-sort | 14 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04688cam a22006252 4500</leader><controlfield tag="001">ZDB-30-ORH-104368195</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20241001123236.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240701s2024 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781003107910</subfield><subfield code="c">ebook</subfield><subfield code="9">978-1-003-10791-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1003107915</subfield><subfield code="9">1-003-10791-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781003852544</subfield><subfield code="c">electronic bk. : PDF</subfield><subfield code="9">978-1-003-85254-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1003852548</subfield><subfield code="c">electronic bk. : PDF</subfield><subfield code="9">1-003-85254-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781003852605</subfield><subfield code="c">electronic bk. : EPUB</subfield><subfield code="9">978-1-003-85260-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1003852602</subfield><subfield code="c">electronic bk. : EPUB</subfield><subfield code="9">1-003-85260-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)104368195</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP104368195</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781003852605</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)104368195</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UB</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="2">23/eng/20240830</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meduna, Alexander</subfield><subfield code="d">1957-</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Jumping computation</subfield><subfield code="b">updating automata and grammars for discontinuous information processing</subfield><subfield code="c">Alexander Meduna, Zbyněk Křivka</subfield></datafield><datafield tag="263" ind1=" " ind2=" "><subfield code="a">2404</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton</subfield><subfield code="b">CRC Press</subfield><subfield code="c">2024</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index. - Description based on print version record and CIP data provided by publisher; resource not viewed</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars. In today⁰́₉s computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, today⁰́₉s computational methods frequently process information in a fundamentally different way, frequently ⁰́₋jumping⁰́₊ over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the words they work on. The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorie des automates</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique ; Mathématiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">COMPUTERS / Computer Graphics / Game Programming & Design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Křivka, Zbyněk</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9780367620936</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">9780367620936</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781003852605/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
id | ZDB-30-ORH-104368195 |
illustrated | Not Illustrated |
indexdate | 2024-12-18T08:48:46Z |
institution | BVB |
isbn | 9781003107910 1003107915 9781003852544 1003852548 9781003852605 1003852602 |
language | English |
open_access_boolean | |
owner | DE-91 DE-BY-TUM |
owner_facet | DE-91 DE-BY-TUM |
physical | 1 online resource |
psigel | ZDB-30-ORH |
publishDate | 2024 |
publishDateSearch | 2024 |
publishDateSort | 2024 |
publisher | CRC Press |
record_format | marc |
spelling | Meduna, Alexander 1957- VerfasserIn aut Jumping computation updating automata and grammars for discontinuous information processing Alexander Meduna, Zbyněk Křivka 2404 Boca Raton CRC Press 2024 1 online resource Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Includes bibliographical references and index. - Description based on print version record and CIP data provided by publisher; resource not viewed Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars. In today⁰́₉s computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, today⁰́₉s computational methods frequently process information in a fundamentally different way, frequently ⁰́₋jumping⁰́₊ over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the words they work on. The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics. Machine theory Computer science Mathematics Computer programming Théorie des automates Informatique ; Mathématiques Algorithmes Programmation (Informatique) algorithms computer programming COMPUTERS / General COMPUTERS / Artificial Intelligence COMPUTERS / Computer Graphics / Game Programming & Design Křivka, Zbyněk VerfasserIn aut 9780367620936 Erscheint auch als Druck-Ausgabe 9780367620936 TUM01 ZDB-30-ORH TUM_PDA_ORH https://learning.oreilly.com/library/view/-/9781003852605/?ar X:ORHE Aggregator lizenzpflichtig Volltext |
spellingShingle | Meduna, Alexander 1957- Křivka, Zbyněk Jumping computation updating automata and grammars for discontinuous information processing Machine theory Computer science Mathematics Computer programming Théorie des automates Informatique ; Mathématiques Algorithmes Programmation (Informatique) algorithms computer programming COMPUTERS / General COMPUTERS / Artificial Intelligence COMPUTERS / Computer Graphics / Game Programming & Design |
title | Jumping computation updating automata and grammars for discontinuous information processing |
title_auth | Jumping computation updating automata and grammars for discontinuous information processing |
title_exact_search | Jumping computation updating automata and grammars for discontinuous information processing |
title_full | Jumping computation updating automata and grammars for discontinuous information processing Alexander Meduna, Zbyněk Křivka |
title_fullStr | Jumping computation updating automata and grammars for discontinuous information processing Alexander Meduna, Zbyněk Křivka |
title_full_unstemmed | Jumping computation updating automata and grammars for discontinuous information processing Alexander Meduna, Zbyněk Křivka |
title_short | Jumping computation |
title_sort | jumping computation updating automata and grammars for discontinuous information processing |
title_sub | updating automata and grammars for discontinuous information processing |
topic | Machine theory Computer science Mathematics Computer programming Théorie des automates Informatique ; Mathématiques Algorithmes Programmation (Informatique) algorithms computer programming COMPUTERS / General COMPUTERS / Artificial Intelligence COMPUTERS / Computer Graphics / Game Programming & Design |
topic_facet | Machine theory Computer science Mathematics Computer programming Théorie des automates Informatique ; Mathématiques Algorithmes Programmation (Informatique) algorithms computer programming COMPUTERS / General COMPUTERS / Artificial Intelligence COMPUTERS / Computer Graphics / Game Programming & Design |
url | https://learning.oreilly.com/library/view/-/9781003852605/?ar |
work_keys_str_mv | AT medunaalexander jumpingcomputationupdatingautomataandgrammarsfordiscontinuousinformationprocessing AT krivkazbynek jumpingcomputationupdatingautomataandgrammarsfordiscontinuousinformationprocessing |