All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F24%3APU151107" target="_blank" >RIV/00216305:26230/24:PU151107 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1201/9781003107910" target="_blank" >http://dx.doi.org/10.1201/9781003107910</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1201/9781003107910" target="_blank" >10.1201/9781003107910</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing

  • Original language description

    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, semiparallel and totally parallel computation. It 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 special attention to power, closure pro

  • Czech name

  • Czech description

Classification

  • Type

    B - Specialist book

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • ISBN

    978-0-367-62093-6

  • Number of pages

    293

  • Publisher name

    CRC Press LLC

  • Place of publication

    Boca Raton

  • UT code for WoS book