Results 321 to 330 of about 4,638,570 (374)
Cognitive-Linguistic Profiles of German Adults with Dyslexia. [PDF]
Behav Sci (Basel)Eckert L, Hartwigsen G, Turker S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
International Colloquium on Automata, Languages and Programming, 2021
In this work, we revisit the problem of testing membership in regular languages, first studied by Alon et al. [1]. We develop a one-sided error property tester for regular languages under weighted edit distance that makes O ( ε − 1 log(1 /ε )) non ...
Gabriel Bathie, Tatiana Starikovskaya
semanticscholar +1 more source
In this work, we revisit the problem of testing membership in regular languages, first studied by Alon et al. [1]. We develop a one-sided error property tester for regular languages under weighted edit distance that makes O ( ε − 1 log(1 /ε )) non ...
Gabriel Bathie, Tatiana Starikovskaya
semanticscholar +1 more source
Balanced-by-Construction Regular and ω-Regular Languages
International Journal of Foundations of Computer Science, 2021Parenn is the typical generalization of the Dyck language to multiple types of parentheses. We generalize its notion of balancedness to allow parentheses of different types to freely commute. We show that balanced regular and [Formula: see text]-regular languages can be characterized by syntactic constraints on regular and [Formula: see text]-regular ...
Luc Edixhoven, Sung-Shik Jongmans
openaire +3 more sources
Regular patterns, regular languages and context-free languages [PDF]
Information Processing Letters, 2010 In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four.
Jain, S., Ong, Y.S., Stephan, F.
openaire +1 more source
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 +2 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