Automata and Language Theory

While Wolfram [wolf84a] showed (and, as we will summarize below, made quite a few interesting deductions from the fact) that is a regular language for all 

---

The most currently used state space models in the context dependability studies are (Cassandras Lafortune 2008) Finite State Automata and Language theory, Petri Nets and Markov chains. Other models can also be mentioned in the context of... 

Recall that the basic notions of abstr2ict automata and formal language theory were very briefly touched upon in our introductory survey in section 2.1.5. 

The Application of Automata and Formal Language Theory to Chemical Process Control... 

Finite Automata with Translucent Letters Applied in Natural and Formal Language Theory... 

Kain, R. Y., "Automata Theory Machines and Languages", McGraw-Hill, New York, 1972. 

Hopcroft, John E., Jeffry D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979. 

Hopcroft, J. E., and UUman, J. D. (1979) Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, Mass. 

To determine appropriate pattern bases, Hanson and Crutchfield combined tools from computation theory and from nonlinear dynamics. Computation theory comes in because Hanson and Crutchfield define pattern bases in terms of formal languages and their corresponding automata. For example, ECA 18 has a single pattern basis Ai8 = (OS). That is, every other site is a zero the remaining sites can be either 0 or 1. (Such a formal-language description of a set of configurations could possibly be discovered automatically via a machine reconstruction algorithm, Crutchfield, 1994). 

---