Login / Signup

State complexity of combined operations for suffix-free regular languages.

Hae-Sung EomYo-Sub Han
Published in: Theor. Comput. Sci. (2013)
Keyphrases
  • regular languages
  • context free grammars
  • computational complexity
  • decision problems
  • regular expressions
  • context free languages
  • database
  • finite state machines
  • finite automata
  • state space
  • grammatical inference