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”

Substitutions on Trajectories

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F04%3A00012612" target="_blank" >RIV/47813059:19240/04:00012612 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Substitutions on Trajectories

  • Original language description

    Word substitutions are binary word operations which can be basically interpreted as a deletion followed by insertion, with some restrictions applied. Besides being itself an interesting topic in formal language theory, they have been naturally applied tomodelling noisy channels. We introduce the concept of substitution on trajectories which generalizes a class of substitution operations. Within this framework, we study their closure properties and decision questions related to language equations. We alsso discuss applications of substitution on trajectories in modelling complex channels and a cryptanalysis problem.

  • Czech name

    Substituce na trajektoriích

  • Czech description

    Word substitutions are binary word operations which can be basically interpreted as a deletion followed by insertion, with some restrictions applied. Besides being itself an interesting topic in formal language theory, they have been naturally applied tomodelling noisy channels. We introduce the concept of substitution on trajectories which generalizes a class of substitution operations. Within this framework, we study their closure properties and decision questions related to language equations. We alsso discuss applications of substitution on trajectories in modelling complex channels and a cryptanalysis problem.

Classification

  • Type

    C - Chapter in a specialist book

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP201%2F02%2FP079" target="_blank" >GP201/02/P079: Distributed models of cognitive computing</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2004

  • 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

  • Book/collection name

    Theory is Forever

  • ISBN

    3-540-22393-2

  • Number of pages of the result

    14

  • Pages from-to

    145-158

  • Number of pages of the book

  • Publisher name

    Springer-Verlag

  • Place of publication

    Berlin

  • UT code for WoS chapter