article · 2008

Non Deterministic RPNI ∗

Pedro García, José Ruiz, Antonio Cano

Cited by 0Abstract and details only

Abstract

A Residual Finite State Automaton (RF SA) [2],[3],[4] is a Nondeterministic Finite Automaton (NFA) in which every state corresponds to a residual language of the language it recognizes. We describe in this paper an algorithm that, for a given sample D, infersaRF SA consistent with D that converges to the canonical RF SA of the target language using a generalization of RP NI algorithm. As NFA’s are sometimes smaller than their equivalent deterministic minimal automaton, the characteristic sample required for inference may also be smaller, so this algorithm may be useful. We also describe how to use this algorithm to infer the universal automaton for a language. 1

Cite this paper

APA 7

García, P., Ruiz, J., & Cano, A. (2008). Non Deterministic RPNI ∗.

MLA 9

García, Pedro, et al. “Non Deterministic RPNI ∗.” 2008.

Chicago

García, Pedro, José Ruiz, and Antonio Cano. 2008. “Non Deterministic RPNI ∗.”

Harvard

García, P., Ruiz, J. and Cano, A. (2008) ‘Non Deterministic RPNI ∗’.

BibTeX

@article{garcia2008deterministic,
  title = {{Non Deterministic RPNI ∗}},
  author = {García, Pedro and Ruiz, José and Cano, Antonio},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.