23 search results - page 5 / 5 » On the Size of the Universal Automaton of a Regular Language |
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
JALC
2007
13 years 5 months ago
2007
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...