23 search results - page 1 / 5 » On the Size of the Universal Automaton of a Regular Language |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
MLG
2007
Springer
13 years 11 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...