Sign in

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages.

Manfred DrosteHeiko Vogler
Published in: Int. J. Found. Comput. Sci. (2014)
Keyphrases
  • context free languages
  • context free grammars
  • grammatical inference
  • context free
  • regular languages
  • upper bound
  • context sensitive
  • finite automata
  • positive and negative
  • finite state
  • inductive inference