Login / Signup

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages.

Janusz A. BrzozowskiCorwin Sinnamon
Published in: LATA (2017)
Keyphrases
  • regular languages
  • grammatical inference
  • decision problems
  • regular expressions
  • context free languages
  • finite automata
  • positive data
  • computational complexity
  • dynamic programming
  • worst case