DETERMINISTIC FINITE AUTOMATA LEARNING USING COUNTEREXAMPLE GUIDED ABSTRACTION REFINEMENT
Subject of Research. The paper studies minimum-sized deterministic finite automata inferring problem. A hybrid method is developed and implemented reducing the given problem to Boolean satisfiability (SAT) technique and at the same time applying a counterexample guided abstraction refinement approac...
Main Author: | Ilya T. Zakirzyanov |
---|---|
Format: | Article |
Language: | English |
Published: |
Saint Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO University)
2020-07-01
|
Series: | Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki |
Subjects: | |
Online Access: | https://ntv.ifmo.ru/file/article/19638.pdf |
Similar Items
-
SAT-Based Counterexample-Guided Inductive Synthesis of Distributed Controllers
by: Konstantin Chukharev, et al.
Published: (2020-01-01) -
BeBoSy: Behavior Examples Meet Bounded Synthesis
by: Daniil Chivilikhin, et al.
Published: (2021-01-01) -
Answer Set Programming for Regular Inference
by: Wojciech Wieczorek, et al.
Published: (2020-10-01) -
Symmetry in Boolean Satisfiability
by: Fadi A. Aloul
Published: (2010-06-01) -
An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata
by: Madoda Nxumalo, et al.
Published: (2017-07-01)