Filters
On the state complexity of the reverse of R- and J-trivial regular languages
-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages language nor by a J-t...
BA - Obecná matematika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Circuit complexity of regular languages
We survey our current knowledge of circuit complexity of regular languages. We show that regular languages are of interest as languages providing understanding of different circuit classes. We also prove t...
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
Complexity in union-free regular languages
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages accepted ...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Complexity in Union-Free Regular Languages
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages recognize...
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems
results. (I) Regular-controlled pGSs having a single component define the family of regular languages. (II) pGSs having two components controlled by infinite regular languages define the family of recursi...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2014 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Regular solutions of language inequalities and well quasi-orders
that all maximal solutions of certain systems of language inequalities are regular are languages recognized by finite simple semigroups. In a similar manner we also demonstrate that the largest solution of the inequality X...
BA - Obecná matematika
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Regular solutions of language inequalities and well quasi-orders
that all maximal solutions of certain systems of language inequalities are regular are languages recognized by finite simple semigroups. In a similar manner we also demonstrate that the largest solution of the inequality X...
BA - Obecná matematika
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Operators on classes of regular languages
The consideration of ordered monoids refines the study of classes of regular languages in terms of pseudovarieties of monoids. Here we propose the ordered alternative to the power operator widely discussed for monoids....
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
On language inequalities XK ⊆ LX
It is known that for a regular language L and an arbitrary language K the largest solution of the inequality XK subset LX is regular. Here we show that there exist finite languages K and P and star-free
BA - Obecná matematika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Efficient separability of regular languages by subsequences and suffixes
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characte...
BA - Obecná matematika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 45 979