Residual Finite State Automata-Reference-Cited by-同舟云学术

Residual Finite State Automata

Published:2001 Issue: Volume: Page:144-157
ISSN:0302-9743
Container-title:STACS 2001
language:
Short-container-title:

Author:

Denis François,Lemay Aurélien,Terlutte Alain

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44693-1_13

Reference14 articles.

1. A. Arnold, A. Dicky and M. Nivat. A note about minimal non-deterministic automata. Bulletin of the EATCS, 47:166–169, June 1992.

2. J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. In Mathematical Theory of Automata, volume 12 of MRI Symposia Series, pages 52–561. 1962.

3. C. Carrez. On the minimalization of non-deterministic automaton. Technical report, Laboratoire de Calcul de la Faculté des Sciences de l’Université de Lille, 1970.

4. F. Denis, A. Lemay and A. Terlutte. Apprentissage de langages réguliers á l’aide d’automates non déterministes. In CAP’2000, 2000.

5. F. Denis, A. Lemay and A. Terlutte. Residual finite state automata. Technical Report LIFL 2000-08, L.I.F.L., 2000.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Canonical Automata via Distributive Law Homomorphisms;Electronic Proceedings in Theoretical Computer Science;2021-12-29

2. Nondeterministic Syntactic Complexity;Lecture Notes in Computer Science;2021

3. Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton;Descriptional Complexity of Formal Systems;2015

4. Minimal DFA for Symmetric Difference NFA;Descriptional Complexity of Formal Systems;2012

5. Some Minimality Results on Biresidual and Biseparable Automata;Language and Automata Theory and Applications;2010