Evaluating the length of distinguishing sequences for nondeterministic Input/Output automata.
Igor B. BurdonovAlexandre KossachevNina YevtushenkoAlexey V. DemakovPublished in: EWDTS (2019)
Keyphrases
- input output
- finite automata
- finite state
- fixed length
- hidden markov models
- internal states
- noise cancellation
- finite alphabet
- arbitrary length
- fuzzy model
- data envelopment analysis
- cellular automata
- finite automaton
- variable length
- markov chain
- fuzzy inference system
- tree automata
- database systems
- ibm zenterprise
- state transition
- initial state
- low cost