automata inference
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 1)

H-INDEX

4
(FIVE YEARS 0)

2021 ◽  
Vol 178 (3) ◽  
pp. 203-227
Author(s):  
Tomasz Jastrzab ◽  
Zbigniew J. Czech ◽  
Wojciech Wieczorek

The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA that represents the target regular language is sought. We define the task of finding an NFA, which accepts all positive examples and rejects all negative ones, as a constraint satisfaction problem, and then propose the parallel algorithms to solve the problem. The results of comprehensive computational experiments on the variety of inference tasks are reported. The question of minimizing an NFA consistent with a learning sample is computationally hard.



2012 ◽  
Vol 41 (1) ◽  
pp. 107-128 ◽  
Author(s):  
Domagoj Babić ◽  
Daniel Reynaud ◽  
Dawn Song


Author(s):  
Domagoj Babić ◽  
Daniel Reynaud ◽  
Dawn Song


Author(s):  
François Coste ◽  
Daniel Fredouille ◽  
Christopher Kermorvant ◽  
Colin de la Higuera
Keyword(s):  




Sign in / Sign up

Export Citation Format

Share Document