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”

Efficient separability of regular languages by subsequences and suffixes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00394007" target="_blank" >RIV/67985840:_____/13:00394007 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-39212-2_16" target="_blank" >http://dx.doi.org/10.1007/978-3-642-39212-2_16</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-39212-2_16" target="_blank" >10.1007/978-3-642-39212-2_16</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient separability of regular languages by subsequences and suffixes

  • Original language description

    When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

    Automata, Languages, and Programming. Part II

  • ISBN

    978-3-642-39211-5

  • ISSN

  • e-ISSN

  • Number of pages

    112

  • Pages from-to

    150-161

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Riga

  • Event date

    Jul 8, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article