This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n14http://linked.opendata.cz/ontology/domain/vavai/
n5https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F13%3A00394007%21RIV14-AV0-67985840/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F13%3A00394007%21RIV14-AV0-67985840
rdf:type
skos:Concept n14:Vysledek
dcterms: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. 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.
dcterms:title
Efficient separability of regular languages by subsequences and suffixes Efficient separability of regular languages by subsequences and suffixes
skos:prefLabel
Efficient separability of regular languages by subsequences and suffixes Efficient separability of regular languages by subsequences and suffixes
skos:notation
RIV/67985840:_____/13:00394007!RIV14-AV0-67985840
n14:predkladatel
n20:ico%3A67985840
n3:aktivita
n6:I
n3:aktivity
I
n3:dodaniDat
n9:2014
n3:domaciTvurceVysledku
n21:7977026
n3:druhVysledku
n17:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
72090
n3:idVysledku
RIV/67985840:_____/13:00394007
n3:jazykVysledku
n16:eng
n3:klicovaSlova
regular languages; separation; piecewise testable languages
n3:klicoveSlovo
n4:separation n4:regular%20languages n4:piecewise%20testable%20languages
n3:kontrolniKodProRIV
[8C6E5789AC60]
n3:mistoKonaniAkce
Riga
n3:mistoVydani
Berlin
n3:nazevZdroje
Automata, Languages, and Programming. Part II
n3:obor
n15:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n9:2013
n3:tvurceVysledku
Martens, W. Czerwiński, W. Masopust, Tomáš
n3:typAkce
n19:WRD
n3:zahajeniAkce
2013-07-08+02:00
s:numberOfPages
112
n11:doi
10.1007/978-3-642-39212-2_16
n18:hasPublisher
Springer-Verlag
n5:isbn
978-3-642-39211-5