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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n4http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14310%2F10%3A00047228%21RIV11-GA0-14310___/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14310%2F10%3A00047228%21RIV11-GA0-14310___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
The classes of languages which are Boolean combinations of languages of the form A*(a1)A*(a2)A*... A*(am)A*, where a1,...,am are letters, with k>m, for a fixed k > 0, form a natural hierarchy within piecewise testable languages and have been studied by Simon, Blanchet-Sadri, Volkov and others. The main issues were the existence of finite bases of identities for the corresponding pseudovarieties of monoids and monoids generating these pseudovarieties. Here we deal with similar questions concerning the finite unions and positive Boolean combinations of the languages of the form above. In the first case the corresponding pseudovarieties are given by a single identity, in the second case there are finite bases for k equals to 1 and 2 and there is no finite basis for k >3 (the case k = 3 remains open). All the pseudovarieties are generated by a single algebraic structure. The classes of languages which are Boolean combinations of languages of the form A*(a1)A*(a2)A*... A*(am)A*, where a1,...,am are letters, with k>m, for a fixed k > 0, form a natural hierarchy within piecewise testable languages and have been studied by Simon, Blanchet-Sadri, Volkov and others. The main issues were the existence of finite bases of identities for the corresponding pseudovarieties of monoids and monoids generating these pseudovarieties. Here we deal with similar questions concerning the finite unions and positive Boolean combinations of the languages of the form above. In the first case the corresponding pseudovarieties are given by a single identity, in the second case there are finite bases for k equals to 1 and 2 and there is no finite basis for k >3 (the case k = 3 remains open). All the pseudovarieties are generated by a single algebraic structure.
dcterms:title
Hierarchies of piecewise testable languages Hierarchies of piecewise testable languages
skos:prefLabel
Hierarchies of piecewise testable languages Hierarchies of piecewise testable languages
skos:notation
RIV/00216224:14310/10:00047228!RIV11-GA0-14310___
n3:aktivita
n12:P n12:Z
n3:aktivity
P(1M0545), P(GA201/09/1313), Z(MSM0021622409)
n3:cisloPeriodika
4
n3:dodaniDat
n6:2011
n3:domaciTvurceVysledku
n9:4177320 n9:3023516
n3:druhVysledku
n7:J
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
261492
n3:idVysledku
RIV/00216224:14310/10:00047228
n3:jazykVysledku
n19:eng
n3:klicovaSlova
varieties of languages; piecewise testable languages; syntactic monoid
n3:klicoveSlovo
n11:piecewise%20testable%20languages n11:varieties%20of%20languages n11:syntactic%20monoid
n3:kodStatuVydavatele
SG - Singapurská republika
n3:kontrolniKodProRIV
[7E012E190EED]
n3:nazevZdroje
International Journal of Foundations of Computer Science
n3:obor
n18:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n14:GA201%2F09%2F1313 n14:1M0545
n3:rokUplatneniVysledku
n6:2010
n3:svazekPeriodika
21
n3:tvurceVysledku
Klíma, Ondřej Polák, Libor
n3:wos
000280773400004
n3:zamer
n4:MSM0021622409
s:issn
0129-0541
s:numberOfPages
17
n10:organizacniJednotka
14310