: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...