Results 241 to 250 of about 4,711,783 (279)
Some of the next articles are maybe not open access.
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
Regular patterns, regular languages and context-free languages
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanjay Jain 0001 +2 more
openaire +3 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
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 +2 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 +2 more sources
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
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