. . "4"^^ . . "Piecewise Testable Languages via Combinatorics on Words"@en . "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." . "NL - Nizozemsko" . "1"^^ . "RIV/00216224:14310/11:00050145!RIV12-GA0-14310___" . "Piecewise testable languages; Syntactic congruence"@en . . "[5600D5F98E5E]" . "20" . . "220375" . . "Piecewise Testable Languages via Combinatorics on Words" . "1"^^ . . . . . "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."@en . . "RIV/00216224:14310/11:00050145" . "Piecewise Testable Languages via Combinatorics on Words"@en . "000295202100004" . . "Kl\u00EDma, Ond\u0159ej" . "Piecewise Testable Languages via Combinatorics on Words" . "10.1016/j.disc.2011.06.013" . . "Discrete Mathematics" . . . "P(1M0545), P(GA201/09/1313), Z(MSM0021622409)" . . . "14310" . "0012-365X" . . "311" .