SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Leucker Martin) "

Search: WFRF:(Leucker Martin)

  • Result 1-10 of 27
Sort/group result
   
EnumerationReferenceCoverFind
1.
  •  
2.
  • Berg, Therese, et al. (author)
  • Insights to Angluin's Learning
  • 2005
  • In: Electr. Notes on Theoret. Comput. Sci.. ; 118, s. 3-18
  • Journal article (peer-reviewed)
  •  
3.
  •  
4.
  • Berg, Therese, et al. (author)
  • Insights to Angluin's Learning
  • 2005
  • In: Electronic Notes in Theoretical Computer Science. - : Elsevier BV. - 1571-0661. ; 118, s. 3-18
  • Journal article (peer-reviewed)abstract
    • Among other domains, learning finite-state machines is important for obtaining a model of a system under development, so that powerful formal methods such as model checking can be applied. A prominent algorithm for learning such devices was developed by Angluin. We have implemented this algorithm in a straightforward way to gain further insights to practical applicability. Furthermore, we have analyzed its performance on randomly generated as well as real-world examples. Our experiments focus on the impact of the alphabet size and the number of states on the needed number of membership queries. Additionally, we have implemented and analyzed an optimized version for learning prefix-closed regular languages. Memory consumption is one major obstacle when we attempted to learn large examples. We see that prefix-closed languages are relatively hard to learn compared to arbitrary regular languages. The optimization, however, shows positive results.
  •  
5.
  • Berg, Therese, et al. (author)
  • Insights to Angluin's Learning
  • 2003
  • Reports (other academic/artistic)abstract
    • Among other domains, learning finite-state machines is important for obtaining a model of a system under development, so that powerful formal methods such as model checking can be applied. A prominent algorithm for learning such devices was developed by Angluin. We have implemented this algorithm in a straightforward way to gain further insights to practical applicability. Furthermore, we have analyzed its performance on randomly generated as well as real-world examples. Our experiments focus on the impact of the alphabet size and the number of states on the needed number of membership queries. Additionally, we have implemented and analyzed an optimized version for learning prefix-closed regular languages. Memory consumption is one major obstacle when we attempted to learn large examples. We see that prefix-closed languages are relatively hard to learn compared to arbitrary regular languages. The optimization, however, shows positive results.
  •  
6.
  •  
7.
  •  
8.
  •  
9.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 27

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view