Login / Signup

Geometrical regular languages and linear Diophantine equations: The strongly connected case.

Jean-Marc ChamparnaudJean-Philippe DubernardFranck GuingneHadrien Jeanne
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • strongly connected
  • regular languages
  • context free languages
  • grammatical inference
  • finite automata
  • context free grammars
  • database
  • learning algorithm
  • decision problems
  • directed graph