On the equivalence of the cube-product and the general product of automata

DOI10.1016/S0304-3975(99)00276-5MaRDI QIDQ1575736zbMATH OpenFDO

Authors N. Delaunay

Publication date 21 August 2000

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

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00276-5

zbMATH Keywords

automatacomplete systemscompositionisomorphic representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3858424 (Why is no real title available?)
• scientific article; zbMATH DE number 4009825 (Why is no real title available?)
• scientific article; zbMATH DE number 4011944 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 3622953 (Why is no real title available?)
• scientific article; zbMATH DE number 480522 (Why is no real title available?)
• scientific article; zbMATH DE number 1047934 (Why is no real title available?)
• scientific article; zbMATH DE number 3451771 (Why is no real title available?)
• scientific article; zbMATH DE number 809136 (Why is no real title available?)
• scientific article; zbMATH DE number 812588 (Why is no real title available?)
• On completeness of nondeterministic automata

Cited in

(1)

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

This page was built for publication: On the equivalence of the cube-product and the general product of automata

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