Analyse und Synthese von asynchronen ND-Automaten (Q1241430)

The author studies an automaton-free characterization of the input-output behaviour of asynchronous non-deterministic automata (in short automata). The main result is: Let \(R\subseteq X^*\times Y^*\). Then there is a regular automaton \(B\) with \(R_B=R\) iff a monotone term \(T\) over \(X\cup Y\) exists with \(\pi(L(T)) =R\). Where: \(X,Y\) are input, output alphabets of \(B\), respectively; \(R_B\) is the input-output relation of the automaton \(B\), \(R_B\subseteq X^*\times Y^*\); ``regular automaton'', ``monotone term'', are defined in the paper.