Inferring regular trace languages from positive and negative samples

Authors:
Antonio Cano Gómez
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Year:
2010

Citing 6
Cited 0

Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Inferring Subclasses of Regular Languages Faster Using RPNI and Forbidden Configurations

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
When Does Partial Commutative Closure Preserve Regularity?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Learning Commutative Regular Languages

ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.