426 search results - page 75 / 86 » Synchronization of Regular Automata |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...