This HTML5 document contains 42 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/
n21http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n19http://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/
n16http://bibframe.org/vocab/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14310%2F11%3A00050145%21RIV12-GA0-14310___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14310%2F11%3A00050145%21RIV12-GA0-14310___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
A regular language L over an alphabet A is called piecewise testable if it is a finite Boolean combination of languages of the form B a1 B a2 B ... B al B, where a1,... ,al are letters from A and B is the set of all words over A. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J-trivial. Nowadays, there exist several proofs of this result based on various methods from algebraic theory of regular languages. Our contribution adds a new purely combinatorial proof. A regular language L over an alphabet A is called piecewise testable if it is a finite Boolean combination of languages of the form B a1 B a2 B ... B al B, where a1,... ,al are letters from A and B is the set of all words over A. An effective characterization of piecewise testable languages was given in 1972 by Simon who proved that a language L is piecewise testable if and only if its syntactic monoid is J-trivial. Nowadays, there exist several proofs of this result based on various methods from algebraic theory of regular languages. Our contribution adds a new purely combinatorial proof.
dcterms:title
Piecewise Testable Languages via Combinatorics on Words Piecewise Testable Languages via Combinatorics on Words
skos:prefLabel
Piecewise Testable Languages via Combinatorics on Words Piecewise Testable Languages via Combinatorics on Words
skos:notation
RIV/00216224:14310/11:00050145!RIV12-GA0-14310___
n13:predkladatel
n20:orjk%3A14310
n3:aktivita
n18:P n18:Z
n3:aktivity
P(1M0545), P(GA201/09/1313), Z(MSM0021622409)
n3:cisloPeriodika
20
n3:dodaniDat
n7:2012
n3:domaciTvurceVysledku
n17:4177320
n3:druhVysledku
n15:J
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
220375
n3:idVysledku
RIV/00216224:14310/11:00050145
n3:jazykVysledku
n11:eng
n3:klicovaSlova
Piecewise testable languages; Syntactic congruence
n3:klicoveSlovo
n12:Syntactic%20congruence n12:Piecewise%20testable%20languages
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[5600D5F98E5E]
n3:nazevZdroje
Discrete Mathematics
n3:obor
n10:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n5:1M0545 n5:GA201%2F09%2F1313
n3:rokUplatneniVysledku
n7:2011
n3:svazekPeriodika
311
n3:tvurceVysledku
Klíma, Ondřej
n3:wos
000295202100004
n3:zamer
n19:MSM0021622409
s:issn
0012-365X
s:numberOfPages
4
n16:doi
10.1016/j.disc.2011.06.013
n21:organizacniJednotka
14310