Login / Signup

Most Complex Deterministic Union-Free Regular Languages.

Janusz A. BrzozowskiSylvie Davies
Published in: DCFS (2018)
Keyphrases
  • regular languages
  • grammatical inference
  • regular expressions
  • context free languages
  • finite automata
  • databases
  • special case
  • logic programs
  • positive and negative
  • context free grammars