Analyse und Synthese von asynchronen ND-Automaten

DOI10.1016/0304-3975(76)90027-XMaRDI QIDQ1241430zbMATH OpenFDO

Authors Peter H. Starke

Publication date 1977

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(76)90027-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1948506
• On commutative asynchronous nondeterministic automata
• scientific article; zbMATH DE number 3995056
• scientific article; zbMATH DE number 554484
• Automata of asynchronous behaviors

Cites work

• scientific article; zbMATH DE number 3489041 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• On Relations Defined by Generalized Finite Automata
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Cited in

(3)

• scientific article; zbMATH DE number 3911715 (Why is no real title available?)
• scientific article; zbMATH DE number 3503135 (Why is no real title available?)
• scientific article; zbMATH DE number 3310916 (Why is no real title available?)

This page was built for publication: Analyse und Synthese von asynchronen ND-Automaten

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241430)