Query learning algorithm for residual symbolic finite automata

研究成果: Conference article

抜粋

We propose a query learning algorithm for residual symbolic finite automata (RSFAs). Symbolic finite automata (SFAs) are finite automata whose transitions are labeled by predicates over a Boolean algebra, in which a big collection of characters leading the same transition may be represented by a single predicate. 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. RSFAs have both properties of SFAs and RFAs and can have more succinct representation of transitions and fewer states than RFAs and deterministic SFAs accepting the same language. The implementation of our algorithm efficiently learns RSFAs over a huge alphabet and outperforms an existing learning algorithm for deterministic SFAs. The result also shows that the benefit of non-determinism in efficiency is even larger in learning SFAs than non-symbolic automata.

元の言語English
ページ(範囲)140-153
ページ数14
ジャーナルElectronic Proceedings in Theoretical Computer Science, EPTCS
305
DOI
出版物ステータスPublished - 2019 9 18
イベント10th International Symposium on Games, Automata, Logics, and Formal Verification, G and ALF 2019 - Bordeaux, France
継続期間: 2019 9 22019 9 3

ASJC Scopus subject areas

  • Software

フィンガープリント Query learning algorithm for residual symbolic finite automata' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用