Login / Signup

Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1RR2 for given regular languages R1, R2.

Kosaburo Hashiguchi
Published in: Theor. Comput. Sci. (2002)
Keyphrases
  • regular languages
  • grammatical inference
  • regular expressions
  • computational complexity
  • language learning
  • context free languages
  • noisy data
  • finite automata
  • xml data
  • machine learning algorithms