This is a poster presentation given at the poster session of the ICFP 2017 Student Research Competition, on September 4, 2017 in Oxford. This presentation covers a brief introduction to the presenter’s formalization of the request routing problem and his proposal of a new family of automata, the finite automata with actions (α-FA).
Abstract from the extended abstract: In this research, the author formalized the request routing problem and proposed a new family of finite automata, finite automata with actions (α-FA), that could be used to solve a subclass of the routing problem. The author also defined the equivocality for α-FA and discussed its decidability. Finally, the author showed that the subclass of routing problem that is solvable with α-FA is exactly the same subclass solvable with the widely deployed regex-match then route method.
- September 4, 2017 – create this talk page