Markov Chains Connected to the Process of Generation of the Words by a Generative System
Matematický popis přirozených jazyků
Mathematical theory of free rhythm
Mathematical theory of static systems
Matrix versions of aperiodic -rational identities
Maximal circular codes versus maximal codes
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.
Maximal circular codes versus maximal codes
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.
Maximal prefix products.
Maximality of codes in free monoids
Mechanized experiment planning in automaton-environment systems
Minimal generators of submonoids of
Minimal NFA and biRFSA languages
In this paper, we define the notion of biRFSA which is a residual finate state automaton (RFSA) whose the reverse is also an RFSA. The languages recognized by such automata are called biRFSA languages. We prove that the canonical RFSA of a biRFSA language is a minimal NFA for this language and that each minimal NFA for this language is a sub-automaton of the canonical RFSA. This leads to a characterization of the family of biRFSA languages. In the second part of this paper, we define the family...
Minimal NFA and biRFSA Languages
In this paper, we define the notion of biRFSA which is a residual finate state automaton (RFSA) whose the reverse is also an RFSA. The languages recognized by such automata are called biRFSA languages. We prove that the canonical RFSA of a biRFSA language is a minimal NFA for this language and that each minimal NFA for this language is a sub-automaton of the canonical RFSA. This leads to a characterization of the family of biRFSA languages. In the second part of this paper, we define the family...
Minimal realizations for finite sets in categorial automata theory
Monoides pointes.
Monoïdes syntactiques et familles de langages rationnels
Motifs et bases de langages
Mots infinis
Mots infinis engendrés par une grammaire algébrique
Mots infinis et langages commutatifs