Results 251 to 260 of about 697,927 (279)
Some of the next articles are maybe not open access.
On the Square of Regular Languages
2014We show that the upper bound (n − k)·2 n + k·2 n − 1 on the state complexity of the square of a regular language recognized by an n-state deterministic finite automaton with k final states is tight in the ternary case for every k with 1 ≤ k ≤ n − 2. Using this result, we are able to define a language that is hard for the square operation on languages ...
Kristína Cevorová +2 more
openaire +1 more source
Limited Automata and Regular Languages
International Journal of Foundations of Computer Science, 2013Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits, for a fixed constant d. In the case d = 1, namely, when a rewriting is possible only during the first visit to a cell, these models have the same power of finite state automata.
G. Pighizzini, A. Pisoni
openaire +2 more sources
MLQ, 2005
For a language \(L\), the square of \(L\), denoted by \(L^{(2)}\), is defined to be the set of squares of the words of \(L\), i.e., \(L^{(2)}=\{ww\mid w\in L\}\). The main result of this paper is the characterization of the regular languages according to whether their squares are 1) regular (REG), 2) context-free (CF) or 3) none of the two.
openaire +1 more source
For a language \(L\), the square of \(L\), denoted by \(L^{(2)}\), is defined to be the set of squares of the words of \(L\), i.e., \(L^{(2)}=\{ww\mid w\in L\}\). The main result of this paper is the characterization of the regular languages according to whether their squares are 1) regular (REG), 2) context-free (CF) or 3) none of the two.
openaire +1 more source
Inferring regular languages and ω -languages
Journal of Logical and Algebraic Methods in Programming, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Regular languages and stone duality
Theory of Computing Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
International Journal of Computer Mathematics, 2011
Shou-Feng Wang, Yu-Qi Guo, Shao-Xian Xu
openaire +1 more source
Shou-Feng Wang, Yu-Qi Guo, Shao-Xian Xu
openaire +1 more source
State Complexity of Regular Languages
J. Autom. Lang. Comb., 2001State complexity is a descriptional complexity measure for regular languages based on the deterministic finite automaton model. We investigate and review the problems related to the state complexity of regular languages, as well as finite languages, and their operations.
openaire +2 more sources
Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts
Theoretical Computer Science, 2020David de Frutos-Escrig +2 more
exaly
State complexity of some operations on binary regular languages
Theoretical Computer Science, 2005Galina Jirásková
exaly