426 search results - page 41 / 86 » Synchronization of Regular Automata |
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
ENTCS
2008
13 years 7 months ago
2008
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...