48 search results - page 7 / 10 » On the Complexity of Intersecting Finite State Automata |
EMNLP
2011
12 years 7 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
CEC
2003
IEEE
14 years 24 days 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...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
FPL
1999
Springer
13 years 11 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...