Results 331 to 340 of about 4,638,570 (374)
Some of the next articles are maybe not open access.
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
Querying Regular Languages over Sliding Windows
Foundations of Software Technology and Theoretical Computer Science, 2016We study the space complexity of querying regular languages over data streams in the sliding window model. The algorithm has to answer at any point of time whether the content of the sliding window belongs to a fixed regular language.
Moses Ganardi +2 more
semanticscholar +1 more source
Unrestricted State Complexity of Binary Operations on Regular Languages
Workshop on Descriptional Complexity of Formal Systems, 2016I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L'_m$ and $L_n$ are languages restricted to be over the same alphabet, with $m$ and $n$ quotients, respectively, the state ...
J. Brzozowski
semanticscholar +1 more source
Descriptional Complexity of Bounded Regular Languages
J. Autom. Lang. Comb., 2016We investigate the descriptional complexity of the subregular language classes of (strongly) bounded regular languages. In the first part, we study the costs for the determinization of nondeterministic finite automata accepting strongly bounded regular ...
Andrea Herrmann +3 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
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
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
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
International Symposium on Mathematical Foundations of Computer Science, 2013Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from another class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two
Thomas Place, L. V. Rooijen, M. Zeitoun
semanticscholar +1 more source
In Search of Most Complex Regular Languages
International Journal of Foundations of Computer Science, 2012Regular languages that are most complex under common complexity measures are studied. In particular, certain ternary languages Un(a,b,c), n ≥ 3, over the alphabet {a,b,c} are examined. It is proved that the state complexity bounds that hold for arbitrary
J. Brzozowski
semanticscholar +1 more source
Undergraduate Topics in Computer Science, 2021
Donald Sannella +3 more
semanticscholar +1 more source
Donald Sannella +3 more
semanticscholar +1 more source