Advertisement

Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language

  • Kosaburo Hashiguchi
Formal Languages And Complexity (Session 15)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 510)

Abstract

There exist algorithms for determining the number of nonterminals in a nonterminal-minimal (generalized) right-linear grammar generating R, and the number of states in a state-minimal (generalized) nondeterministic finite automaton accepting R for any given regular language R.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. MAH[78]
    M.A.Harrison, Introduction to Formal Language Theory, Addison-Wesley (1978)Google Scholar
  2. KH[82]
    K. Hashiguchi, Rugular Languages of star heigt one, Inform. Control 53(1982)199–210Google Scholar
  3. OHI[78]
    O.H.Ibarra, The unsolvability of the equivalence problem for ɛ-free NGSM's with unary input (output) alphabet and applications, SIAM J.Comput. (1978)524–532.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Kosaburo Hashiguchi
    • 1
  1. 1.Department of Information and Computer SciencesToyohashi University of TechnologyTempaku, ToyohashiJapan

Personalised recommendations