Wenjing Chu

Learning Probabilistic Languages by k-Testable Machines

2020

A k-testable machine is a finite automaton which recognizes a language L by only seeing a window of size k of each string in L. In this paper we use k-testable machines to recognize probabilistic …