495 search results - page 25 / 99 » Automata and differentiable words |
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
EH
2002
IEEE
14 years 22 days ago
2002
IEEE
Fluid flow in porous media is a dynamic process that is traditionally modeled using PDE (Partial Differential Equations). In this approach, physical properties related to fluid fl...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
WIA
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
WIA
1998
Springer
13 years 12 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...