Results 291 to 300 of about 4,664,026 (360)
Some of the next articles are maybe not open access.
Inferring regular languages and ω -languages
Journal of Logical and Algebraic Methods in Programming, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Fisman
openaire +3 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
Dynamic Membership for Regular Languages
International Colloquium on Automata, Languages and Programming, 2021We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w.
Antoine Amarilli +2 more
semanticscholar +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.
Han, Yo-Sub, Salomaa, Kai, Wood, Derick
openaire +2 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.
Han, Yo-Sub, Salomaa, Kai, Wood, Derick
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
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.
Eisman, Gerry, Ravikumar, Bala
openaire +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 +2 more sources
Randomized sliding window algorithms for regular languages
International Colloquium on Automata, Languages and Programming, 2018A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last $n$ symbols.
Moses Ganardi +2 more
semanticscholar +1 more source