1705 search results - page 12 / 341 » Representing Constraints with Automata |
ICSEA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper describes an innovative approach to network testing based on automatically generating and analyzing state machine models of network behavior. The models are generate...
FUIN
2002
13 years 7 months ago
2002
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit aut...
VLSISP
2008
13 years 7 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...
QSIC
2005
IEEE
14 years 1 months ago
2005
IEEE
In component software, the independence of components is achieved by separating their interfaces from implementations. The interface definition of a component serves as the contr...
NAACL
2001
13 years 9 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...