Definition and Expansion of Composite Automata in IOA

Joshua Tauber and Stephen Garland

MIT-CSAIL-TR-2004-048, MIT Computer Science and Artificial Intelligence Laboratory, July 2004

The IOA language provides notations for defining both primitive and composite I/O automata. This note describes, both formally and with examples, the constraints on these definitions, the composability requirements for the components of a composite automaton, and the transformation of a composite automaton into an equivalent primitive automaton.

Back to Publications of Stephen J. Garland