1 code implementation • 20 Feb 2019 • Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
Residual finite automata (RFAs) are a special type of non-deterministic finite automata which can be exponentially smaller than the minimum deterministic finite automata and have a favorable property for learning algorithms.
1 code implementation • 26 Jun 2018 • Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph.
Data Structures and Algorithms
