How Many States Can Have a Minimal DFA that Accepts Words of Length Less Than or Equal to l?
Cezar CâmpeanuPublished in: DCFS (2002)
Keyphrases
- deterministic finite automata
- minimal length
- finite alphabet
- n gram
- regular expressions
- related words
- keywords
- word sense disambiguation
- fixed length
- text corpora
- total length
- english words
- word meaning
- noun phrases
- word recognition
- text corpus
- partial knowledge
- maximum number
- stop words
- finite state machines
- neural network