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”

Describing periodicity in two-way deterministic finite automata using transformation semigroups

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F11%3A00050221" target="_blank" >RIV/00216224:14310/11:00050221 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-22321-1_28" target="_blank" >http://dx.doi.org/10.1007/978-3-642-22321-1_28</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-22321-1_28" target="_blank" >10.1007/978-3-642-22321-1_28</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Describing periodicity in two-way deterministic finite automata using transformation semigroups

  • Original language description

    A framework for the study of periodic behaviour of two-way deterministic finite automata (2DFA) is developed. Computations of 2DFAs are represented by a two-way analogue of transformation semigroups, every element of which describes the behaviour of a 2DFA on a certain string x. A subsemigroup generated by this element represents the behaviour on strings in x^+. The main contribution of this paper is a description of all such monogenic subsemigroups up to isomorphism. This characterization is then usedto show that transforming an n-state 2DFA over a one-letter alphabet to an equivalent sweeping 2DFA requires exactly n + 1 states, and transforming it to a one-way automaton requires exactly max{G(n-l) + l + 1 | 0 &lt;= l &lt;= n} states, where G(k) is the maximum order of a permutation of k elements.

  • 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/GA201%2F09%2F1313" target="_blank" >GA201/09/1313: Algebraic Methods in Automata and Formal Language Theory II</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2011

  • 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

    Developments in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings

  • ISBN

    978-3-642-22320-4

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    324-336

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Milan, Italy

  • Event date

    Jan 1, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article