Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata

Maria Monks

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite st…