Results 11 to 20 of about 697,927 (279)
Caterpillar dualities and regular languages [PDF]
SIAM Journal on Discrete Mathematics, 2012 We characterize obstruction sets in caterpillar dualities in terms of regular languages, and give a construction of the dual of a regular family of caterpillars.
Erdős, Péter L. +2 more
core +3 more sources
Interval type-2 fuzzy automata and Interval type-2 fuzzy grammar [PDF]
, 2021 The purpose of the present work is to introduce and study the concept of interval type-2 (IT2) fuzzy grammar which recognizes the given IT2 fuzzy languages. The relationship between IT2 fuzzy automata and IT2 fuzzy (weak) regular grammars is discussed.
Kavikumar, Jacob +2 more
core +1 more source
Most Complex Regular Ideal Languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there
Janusz Brzozowski +2 more
doaj +1 more source
Complexity in Prefix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible.
Galina Jirásková, Monika Krausová
doaj +1 more source
Rate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted.
Lorenz A. Gilch
doaj +1 more source
New decidable upper bound of the second level in the Straubing-Therien concatenation hierarchy of star-free languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to ...
Jorge Almeida, Ondrej Klima
doaj +1 more source
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strict unboundedness), and ωBS-regular ...
Dario Della Monica +2 more
doaj +1 more source
Decision trees for regular factorial languages
Array, 2022 In this paper, we study arbitrary regular factorial languages over a finite alphabet Σ. For the set of words L(n)of the length n belonging to a regular factorial language L, we investigate the depth of decision trees solving the recognition and the ...
Mikhail Moshkov
doaj +1 more source
Odometers on Regular Languages [PDF]
Theory of Computing Systems, 2005 Odometers or "adding machines" are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A,
Berthé,, Rigo, Michel
openaire +2 more sources
Weakly and Strongly Irreversible Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages ...
Giovanna J. Lavado +2 more
doaj +1 more source