426 search results - page 49 / 86 » Synchronization of Regular Automata |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
LATIN
1992
Springer
13 years 11 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
WSC
2007
13 years 10 months ago
2007
The simulation of group-work interaction is significant for Chinese enterprise organizational management. As a result, a cellular-automata based simulation model is put forward. T...
TCS
2008
13 years 7 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
JUCS
2002
13 years 7 months ago
2002
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...