DARSTELLBARKEIT VON EREIGNISSEN IN Z‐ENDLICHEN AUTOMATEN

DOI10.1002/MALQ.19690150603MaRDI QIDQ5565129zbMATH OpenOpenAlexFDO

Authors Hans-Joachim Pohl

Publication date 1969

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19690150603

zbMATH Keywords

languages, automata, networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(4)

• scientific article; zbMATH DE number 3414213 (Why is no real title available?)
• scientific article; zbMATH DE number 3309211 (Why is no real title available?)
• scientific article; zbMATH DE number 3414210 (Why is no real title available?)
• scientific article; zbMATH DE number 3197112 (Why is no real title available?)

This page was built for publication: DARSTELLBARKEIT VON EREIGNISSEN IN Z‐ENDLICHEN AUTOMATEN

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