Sciweavers

245 search results - page 16 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
DLT
2006
13 years 9 months ago
Computing by Only Observing
The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the ...
Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Ho...
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
ICALP
2009
Springer
14 years 8 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
ARCS
2004
Springer
14 years 1 months ago
Extending the MVC Design Pattern towards a Task-Oriented Development Approach for Pervasive Computing Applications
Abstract. This paper addresses the implementation of pervasive Java Web applications using a development approach that is based on the Model-ViewController (MVC) design pattern. We...
Patrick Sauter, Gabriel Vögler, Günther ...
RIA
2006
84views more  RIA 2006»
13 years 7 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier