TL;DR本文研究了基于有限状态机和重写规则的形式语法学习,提出了一种基于 SAT 求解器的 NFA 自动机规模求解方法,并验证了该方法的高效性。
Abstract
grammatical inference consists in learning a formal grammar as a finite state
machine or as a set of rewrite rules. In this paper, we are concerned with
inferring nondeterministic finite automata (NFA) that must