Abstract
We introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular language L, there exists a unique RFSA that recognizes L and which has both a minimal number of states and a maximal number of transitions. Moreover, this canonical RFSA may be exponentially smaller than the equivalent minimal DFA but it also may have the same number of states as the equivalent minimal DFA, even if minimal equivalent NFA are exponentially smaller. We provide an algorithm that computes the canonical RFSA equivalent to a given NFA. We study the complexity of several decision and construction problems linked to the class of RFSA: most of them are PSPACE-complete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Arnold, A. Dicky and M. Nivat. A note about minimal non-deterministic automata. Bulletin of the EATCS, 47:166–169, June 1992.
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.
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.
F. Denis, A. Lemay and A. Terlutte. Apprentissage de langages réguliers á l’aide d’automates non déterministes. In CAP’2000, 2000.
F. Denis, A. Lemay and A. Terlutte. Residual finite state automata. Technical Report LIFL 2000-08, L.I.F.L., 2000.
Michael R. Garey and David S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completness. W.H. Freeman and Co, San Francisco, 1979.
E.M. Gold. Complexity of automaton identification from given data. Inform. Control, 37:302–320, 1978.
Colin De La Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27:125–137, 1997.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, Annals of Math. Studies 34. New Jersey, 1956.
J. Myhill. Finite automata and the representation of events. Technical Report 57-624, WADC, 1957.
A. Nerode. Linear automaton transformation. In Proc. American Mathematical Society, volume 9, pages 541–544, 1958.
J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, pages 49–61, 1992.
Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41–110. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denis, F., Lemay, A., Terlutte, A. (2001). Residual Finite State Automata. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-44693-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41695-1
Online ISBN: 978-3-540-44693-4
eBook Packages: Springer Book Archive