Results 21 to 30 of about 4,638,570 (374)
Parameterized regular expressions and their languages [PDF]
Theoretical Computer Science, 2013 We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if it is denoted by some regular expression obtained by replacing variables with letters; under the certainly ...
BarcelĆ³ Baeza, Pablo +2 more
openaire +12 more sources
From Regular to Strictly Locally Testable Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the transition ...
Stefano Crespi Reghizzi +1 more
doaj +3 more sources
Dynamic Membership for Regular Languages
International Colloquium on Automata, Languages and Programming, 2021 We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w. We consider this problem on the unit cost RAM model with logarithmic word length, where the problem always has a solution ...
Amarilli, Antoine +2 more
openaire +5 more sources
On the Structure and Complexity of Rational Sets of Regular Languages [PDF]
arXiv, 2013 In a recent thread of papers, we have introduced FQL, a precise specification language for test coverage, and developed the test case generation engine FShell for ANSI C.
Holzer, Andreas +3 more
core +3 more sources
On counting functions and slenderness of languages [PDF]
, 2019 We study counting-regular languages -- these are languages $L$ for which there is a regular language $L'$ such that the number of strings of length $n$ in $L$ and $L'$ are the same for all $n$.
Ibarra, Oscar H. +2 more
core +2 more sources
Regular realizability problems and regular languages [PDF]
arXiv, 2015 We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. We consider two kind of problems depending on representation of regular language. If a regular language on input is represented by a DFA, then we
openaire +3 more sources
Practical Experiments with Regular Approximation of Context-Free Languages [PDF]
Computational Linguistics, 2021 Mark-Jan Nederhof
doaj +2 more sources
The dissecting power of regular languages [PDF]
Information Processing Letters, 2013 A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they need to cut numerous infinite languages.
Yuichi Kato, Tomoyuki Yamakami
openaire +4 more sources
Regular languages and partial commutations
Information and Computation, 2013 The first author was supported by the project Automatas en dispositivos moviles: interfaces de usuario y realidad aumentada (PAID 2019-06-11) supported by Universidad Politecnica de Valencia. The third author was supported by the project ANR 2010 BLAN 0202 02 FREC.
Cano, Antonio +2 more
openaire +3 more sources
Co-lexicographically Ordering Automata and Regular Languages - Part I [PDF]
Journal of the ACM, 2022 The states of a finite-state automaton š¯’© can be identified with collections of words in the prefix closure of the regular language accepted by š¯’©. But words can be ordered, and among the many possible orders a very natural one is the co-lexicographic ...
Nicola Cotumaccio +3 more
semanticscholar +1 more source