Sciweavers

303 search results - page 32 / 61
» Automata on Gauss Words
Sort
View
GG
2004
Springer
14 years 3 months ago
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Tanguy Urvoy
JGO
2011
122views more  JGO 2011»
13 years 4 months ago
Towards the global solution of the maximal correlation problem
The maximal correlation problem (MCP) aiming at optimizing correlation between sets of variables plays a very important role in many areas of statistical applications. Currently, a...
Lei-Hong Zhang, Li-Zhi Liao, Li-Ming Sun
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 4 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha
LATA
2010
Springer
14 years 1 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
WIA
2001
Springer
14 years 2 months ago
Past Pushdown Timed Automata
d Abstract) Zhe Dang   , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard ...