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”

Descriptional Complexity of Biautomata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F12%3A00057568" target="_blank" >RIV/00216224:14310/12:00057568 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-31623-4_15" target="_blank" >http://dx.doi.org/10.1007/978-3-642-31623-4_15</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-31623-4_15" target="_blank" >10.1007/978-3-642-31623-4_15</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Descriptional Complexity of Biautomata

  • Original language description

    A biautomaton is a finite automaton which arbitrarily alternates between reading the input word from the left and from the right. Some compatibility assumptions in the formal definition of a biautomaton ensure that the acceptance of an input does not depend on the way how the input is read. The paper studies the constructions of biautomata from the descriptional point of view. It proves the tight bounds on the size of a biautomaton recognizing a regular language represented by a deterministic or nondeterministic automaton.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

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

Others

  • Publication year

    2012

  • 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

  • Article name in the collection

    Descriptional Complexity of Formal Systems

  • ISBN

    9783642316227

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    196-208

  • Publisher name

    Springer-Verlag Berlin Heidelberg

  • Place of publication

    Berlin Heidelberg

  • Event location

    Braga, Portugal

  • Event date

    Jan 1, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article