89 search results - page 15 / 18 » On the Translation of Procedures to Finite Machines |
SIGIR
2003
ACM
14 years 1 months ago
2003
ACM
Translation of proper names is generally recognized as a significant problem in many multi-lingual text and speech processing applications. Even when large bilingual lexicons use...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...