Login / Signup

On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages.

Yael Maon
Published in: Theor. Comput. Sci. (1985)
Keyphrases
  • context free languages
  • context free grammars
  • context free
  • grammatical inference
  • regular languages
  • hidden markov models