On the Length of Homing Sequences for Nondeterministic Finite State Machines.
Natalia KushikNina YevtushenkoPublished in: CIAA (2013)
Keyphrases
- finite state machines
- hidden markov models
- finite state automata
- fixed length
- model checking
- arbitrary length
- finite alphabet
- finite automata
- finite state
- longest common subsequence
- variable length
- regular expressions
- digital circuits
- database
- initial state
- maximum number
- relational data
- regular languages
- long sequences
- information extraction
- mutation testing