About: Piecewise Testable Languages via Combinatorics on Words     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
Title
  • Piecewise Testable Languages via Combinatorics on Words
  • Piecewise Testable Languages via Combinatorics on Words (en)
skos:prefLabel
  • Piecewise Testable Languages via Combinatorics on Words
  • Piecewise Testable Languages via Combinatorics on Words (en)
skos:notation
  • RIV/00216224:14310/11:00050145!RIV12-GA0-14310___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/09/1313), Z(MSM0021622409)
http://linked.open...iv/cisloPeriodika
  • 20
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 220375
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14310/11:00050145
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Piecewise testable languages; Syntactic congruence (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • NL - Nizozemsko
http://linked.open...ontrolniKodProRIV
  • [5600D5F98E5E]
http://linked.open...i/riv/nazevZdroje
  • Discrete Mathematics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 311
http://linked.open...iv/tvurceVysledku
  • Klíma, Ondřej
http://linked.open...ain/vavai/riv/wos
  • 000295202100004
http://linked.open...n/vavai/riv/zamer
issn
  • 0012-365X
number of pages
http://bibframe.org/vocab/doi
  • 10.1016/j.disc.2011.06.013
http://localhost/t...ganizacniJednotka
  • 14310
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 35 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software