Results 211 to 220 of about 1,772,421 (241)
Some of the next articles are maybe not open access.
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
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
Circuit Complexity of Regular Languages [PDF]
Theory of Computing Systems, 2007 We survey the current state of knowledge on the circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size circuits, extending the result of Chandra et al. (J. Comput. Syst. Sci. 30:222–234, 1985).
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 +2 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
openaire +3 more sources
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
openaire +3 more sources
1983
Publisher Summary Computability theory is the theory of computation obtained when limitations of space and time are deliberately ignored. In automata theory, computation is studied in a context in which bounds on space and time are entirely relevant. The point of view of computability theory is exemplified in the behaviour of a Turing machine in which
Elaine J. Weyuker, Martin Davis
openaire +2 more sources
Publisher Summary Computability theory is the theory of computation obtained when limitations of space and time are deliberately ignored. In automata theory, computation is studied in a context in which bounds on space and time are entirely relevant. The point of view of computability theory is exemplified in the behaviour of a Turing machine in which
Elaine J. Weyuker, Martin Davis
openaire +2 more sources