Two-sided locally testable languages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10392015" target="_blank" >RIV/00216208:11320/18:10392015 - isvavai.cz</a>
Result on the web
<a href="http://im.saske.sk/ncma2018/ncma2018_ocg332.pdf" target="_blank" >http://im.saske.sk/ncma2018/ncma2018_ocg332.pdf</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Two-sided locally testable languages
Original language description
We extend the two-sided strictly testable languages to the two-sided testable languages, showing that for each integer k>= 1 and each symmetric binary relation R on SIgma^k, the family 2LTR(k) of k-R-testable languages is obtained as a special kind of Boolean closure of the family of two- sided strictly k-testable languages. We further study closure and non-closure properties and prove that all two-sided locally testable languages are even linear languages.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018
ISBN
978-3-903035-21-8
ISSN
—
e-ISSN
neuvedeno
Number of pages
16
Pages from-to
133-148
Publisher name
Österreichische Computer Gesellschaft
Place of publication
Wien
Event location
Košice, Slovakia
Event date
Aug 21, 2018
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)