18 search results - page 1 / 4 » On the computation of quotients and factors of regular langu... |
FCSC
2010
13 years 3 months ago
2010
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
ADBIS
2009
Springer
13 years 11 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
TCS
2008
13 years 4 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
DLT
2009
13 years 2 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...