Results 251 to 260 of about 1,782,235 (292)
Language-dependency of the left-digit effect in number line estimation and the role of number word inversion. [PDF]
Sci RepSixtus E +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Regular patterns, regular languages and context-free languages
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Stephan, Sanjay Jain
exaly +4 more sources
International Journal of Foundations of Computer Science, 2009 In this paper we prove that it is decidable whether the set pow (L), which we get by taking all the powers of all the words in some regular language L, is regular or not. The problem was originally posed by Calbrix and Nivat in 1995. Partial solutions have been given by Cachat for unary languages and by Horváth et al. for various kinds of exponent sets
SZILÁRD ZSOLT FAZEKAS
openaire +3 more sources
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae, 2011Approximate computation is a central concept in algorithms and computation theory. Our notion of approximation is that the algorithm performs correctly on most of the inputs. We propose some finite automata models to study the question of how well a finite automaton can approximately recognize a non-regular language.
Gerry Eisman, Bala Ravikumar
openaire +1 more source
Fundamenta Informaticae, 2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode.
Han, Yo-Sub, Salomaa, Kai, Wood, Derick
openaire +3 more sources
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode.
Han, Yo-Sub, Salomaa, Kai, Wood, Derick
openaire +3 more sources
Fundamenta Informaticae, 2017
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allowing one to define arbitrary languages.
Genova, D., Hoogeboom, H.J.
openaire +4 more sources
We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allowing one to define arbitrary languages.
Genova, D., Hoogeboom, H.J.
openaire +4 more sources
On the Density of Regular Languages
Fundamenta Informaticae, 2019Let ∑ be an alphabet which has at least two symbols. The density of L ⊆ ∑* is defined as D( L) := lim n | L ∩ ∑ n |/|∑ n | ∈ [0, 1], provided that the limit exists. In 2015, R. Sin’ya has discovered an interesting
openaire +2 more sources
Acta Informatica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen-Ming Fan +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen-Ming Fan +2 more
openaire +1 more source
Information Sciences, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. S. Malik +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. S. Malik +2 more
openaire +3 more sources