[책][B] Grammatical inference: learning automata and grammars
C De la Higuera - 2010 - books.google.com
The problem of inducing, learning or inferring grammars has been studied for decades, but
only in recent years has grammatical inference emerged as an independent field with …
only in recent years has grammatical inference emerged as an independent field with …
[PDF][PDF] Regular expression learning for information extraction
Regular expressions have served as the dominant workhorse of practical information
extraction for several years. However, there has been little work on reducing the manual …
extraction for several years. However, there has been little work on reducing the manual …
Applications in security and evasions in machine learning: a survey
In recent years, machine learning (ML) has become an important part to yield security and
privacy in various applications. ML is used to address serious issues such as real-time …
privacy in various applications. ML is used to address serious issues such as real-time …
Generating annotated behavior models from end-user scenarios
Requirements-related scenarios capture typical examples of system behaviors through
sequences of desired interactions between the software-to-be and its environment. Their …
sequences of desired interactions between the software-to-be and its environment. Their …
Learning-based software testing: a tutorial
We present an overview of the paradigm of learning-based testing (LBT) for software
systems. LBT is a fully automated method for specification-based black-box testing using …
systems. LBT is a fully automated method for specification-based black-box testing using …
Incremental learning-based testing for reactive systems
We show how the paradigm of learning-based testing (LBT) can be applied to automate
specification-based black-box testing of reactive systems. Since reactive systems can be …
specification-based black-box testing of reactive systems. Since reactive systems can be …
Integration of learning-based testing and supervisory control for requirements conformance of black-box reactive systems
A fundamental requirement of the supervisory control theory (SCT) of discrete-event systems
is a finite automaton model of the plant. The requirement does not hold for black-box …
is a finite automaton model of the plant. The requirement does not hold for black-box …
Learning Moore machines from input–output traces
The problem of learning automata from example traces (but no equivalence or membership
queries) is fundamental in automata learning theory and practice. In this paper, we study this …
queries) is fundamental in automata learning theory and practice. In this paper, we study this …
A learning-based synthesis approach to the supremal nonblocking supervisor of discrete-event systems
H Zhang, L Feng, Z Li - IEEE Transactions on Automatic …, 2018 - ieeexplore.ieee.org
This paper presents a novel approach to synthesize supremal nonblocking supervisors of
discrete-event systems (DES), when the automaton models of specifications are not …
discrete-event systems (DES), when the automaton models of specifications are not …
Algorithms for learning regular expressions from positive data
H Fernau - Information and Computation, 2009 - Elsevier
We describe algorithms that directly infer very simple forms of 1-unambiguous regular
expressions from positive data. Thus, we characterize the regular language classes that can …
expressions from positive data. Thus, we characterize the regular language classes that can …