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”

Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10145554" target="_blank" >RIV/00216208:11320/13:10145554 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/13:00212544

  • Result on the web

    <a href="http://link.springer.com.ezproxy.is.cuni.cz/chapter/10.1007/978-3-642-39274-0_24" target="_blank" >http://link.springer.com.ezproxy.is.cuni.cz/chapter/10.1007/978-3-642-39274-0_24</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-39274-0_24" target="_blank" >10.1007/978-3-642-39274-0_24</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata

  • Original language description

    We compare two types of automata for accepting picture languages to each other: the two-dimensional one-marker automaton and the sgraffito automaton. On the one hand, it is shown that deterministic sgraffito automata are strictly more powerful than deterministic two-dimensional one-marker automata. On the other hand, nondeterministic two-dimensional one-marker automata accept some picture languages that cannot be accepted by sgraffito automata. However, if nondeterministic two-dimensional one-marker automata were to accept all picture languages that are accepted by (deterministic) sgraffito automata, then the complexity classes NL (nondeterministic logarithmic space) and P (deterministic polynomial time) would coincide. Accordingly, it is likely that the classes of picture languages accepted by these two types of nondeterministic automata are incomparable under inclusion.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2013

  • 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

    Implementation and Application of Automata

  • ISBN

    978-3-642-39273-3

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    268-279

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Halifax, Kanada

  • Event date

    Jul 16, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article