He is most notable for his contributions to several fields of discrete mathematics including formal languages and automata theory.
22.
It also so happens that invariance under bisimulation is the root of tree model property which helps towards defining automata theory.
23.
Many hard problems in automata theory involve finding the right construction of an automaton such that the problem can be answered.
24.
Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages:
25.
In automata theory, some authors use the term " transformation semigroup " to refer to a semigroup a correspondence between the two notions.
26.
Krohn Rhodes theory, sometimes also called " algebraic automata theory ", gives powerful decomposition results for finite transformation semigroups by cascading simpler components.
27.
In automata theory, an "'alternating tree automaton "'is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton ( NFA ).
28.
""'Introduction to Automata Theory, Languages, and Computation " "'is an influential computer science textbook by John Hopcroft and Jeffrey Ullman on formal languages and the theory of computation.
29.
In computer science, more precisely in automata theory, a "'recognizable set "'of a monoid is a subset that can be distinguished by some morphism to a finite monoid.
30.
She earned a Ph . D . from Harvard University in 1973; her dissertation concerned automata theory and formal languages, and was supervised by Ronald V . Book.
