31. His work on automata theory investigates determinization and complementation of Rabin automata . 32. As with string automata , a TWA may be deterministic or nondeterministic. 33. Automata -Based Programming technology was introduced by Anatoly Shalyto in 1991.34. Collected articles on automata -based programming were published in ITMO University. 35. Bulletin contains 28 articles on different problems of automata -based programming. 36. Philidor also displayed and demonstrated a variety of automata and mechanical devices. 37. Regular expressions and nondeterministic finite automata are two representations of formal languages. 38. Recognizable sets are useful in automata theory, formal languages and algebra. 39. Automata first appeared in Europe in the early Renaissance.40. When these are approximated by cellular automata , they often yield similar patterns.
