Login / Signup

On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.

Juhani KarhumäkiH. C. M. Kleijn
Published in: MFCS (1984)
Keyphrases
  • regular languages
  • context free languages
  • finite automata
  • grammatical inference
  • decision problems
  • regular expressions
  • context free grammars
  • objective function
  • logic programs
  • decision rules