Results 251 to 260 of about 4,711,783 (279)
Some of the next articles are maybe not open access.
J. Comput. Syst. Sci., 1992
The paper deals with the problem of recognition of regular languages by the circuits of certain type. The theory of the syntactic monoid of a regular language is used to present various characterizations of the regular languages in the circuit complexity class \(AC^ 0\). Also an effective procedure for deciding the membership of a regular language in \(
David A. Mix Barrington +3 more
openaire +2 more sources
The paper deals with the problem of recognition of regular languages by the circuits of certain type. The theory of the syntactic monoid of a regular language is used to present various characterizations of the regular languages in the circuit complexity class \(AC^ 0\). Also an effective procedure for deciding the membership of a regular language in \(
David A. Mix Barrington +3 more
openaire +2 more sources
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 +3 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
Deciding Determinism of Regular Languages
Theory of Computing Systems, 2014The paper deals with the problem of deciding whether a given regular language \(L\) can be described by a deterministic (also called one-unambiguous) regular expression, that is, a regular expression such that each occurrence of a letter in any word from \(L\) can be uniquely matched to a symbol in this expression, without looking ahead in the word ...
Ping Lu 0007 +2 more
openaire +3 more sources
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 +3 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
Language operations with regular expressions of polynomial size
Theoretical Computer Science, 2009Markus Holzer, Hermann Gruber
exaly
Generalization of automatic sequences for numeration systems on a regular language
Theoretical Computer Science, 2000Michel Rigo
exaly