Results 261 to 270 of about 1,782,235 (292)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1974
Random occurrences of three types of errors in the input to a finite automaton are considered: an α error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a δ error is a change of one symbol into another symbol.
openaire +2 more sources
Random occurrences of three types of errors in the input to a finite automaton are considered: an α error is a deletion of one symbol from the input string; a β error is an insertion of one extra symbol; and a δ error is a change of one symbol into another symbol.
openaire +2 more sources
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
Deterministic regular languages
1992The ISO standard for Standard Generalized Markup Language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard the right hand sides of productions are called {\sl content models} and they are based on regular expressions. The allowable regular expressions are those that are ``unambiguous'''' as defined
Anne Brüggemann-Klein, Derick Wood
openaire +2 more sources
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
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
Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts
Theoretical Computer Science, 2020Dario della Monica +2 more
exaly