Inferring Regular Trace Languages from Positive and Negative Samples
نویسنده
چکیده
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called the independence relation. This algorithm is similar to the RPNI algorithm, but it is based on Asynchronous Cellular Automata. For this purpose, we define Asynchronous Cellular Moore Machines and implement the merge operation as the calculation of an equivalence relation. After presenting the algorithm we provide a proof of its convergence (which is more complicated than the proof of convergence of the RPNI because there are no Minimal Automata for Asynchronous Automata), and we discuss the complexity of the algorithm.
منابع مشابه
Inferring stochastic regular grammars with recurrent neural networks
Recent work has shown that the extraction of symbolic rules improves the generalization performance of recurrent neural networks trained with complete (positive and negative) samples of regular languages. This paper explores the possibility of inferring the rules of the language when the network is trained instead with stochastic, positive-only data. For this purpose, a recurrent network with t...
متن کاملLearning Parallel Systems by Regular Trace Languages
We study the problem of learning by examples the structure of regular trace languages, a useful formalization of systems or programs of concurrent operations. Negative results are showed about traces with empty and total concurrency, and we compare them with a positive result derived from a work by N. Abe, about trace languages generated by commutative regular languages.
متن کاملInferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations
Many varieties of regular languages have characterizations in terms of forbidden-patterns of their accepting finite automata. The use of patterns while inferring languages belonging to those families through the RPNI-Lang algorithm help to avoid overgeneralization in the same way as negative samples do. The aim of this paper is to describe and prove the convergence of a modification of the RPNI...
متن کاملInferring Uniquely Terminating Regular Languages from Positive Data
We define a new subclass of regular languages, called uniquely terminating regular languages, which can be inferred from positive data. The class of uniquely terminating regular languages and the previously known subclasses of regular languages inferable from positive data are incomparable.
متن کاملEfficient Learning of Regular Languages Using Teacher-Supplied Positive Samples and Learner-Generated Queries
We present a new algorithm for efficient learning of regular languages from examples and queries. A reliable teacher who knows the unknown regular grammar G (or is able to determine if certain strings are accepted by the grammar) will guide the learner in achieving the goal of inferring an equivalent grammar $\mbox{G}^{*}$. The teacher provides the learner with a structurally complete set of po...
متن کامل