Login / Signup

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

Juhani KarhumäkiH. C. M. Kleijn
Published in: RAIRO Theor. Informatics Appl. (1985)
Keyphrases
  • regular languages
  • regular expressions
  • grammatical inference
  • finite automata
  • context free languages
  • decision problems
  • knowledge representation