Recognizability in m n-polypodes. II.

zbMATH Open1191.20066MaRDI QIDQ3645876FDOQ3645876

Authors: George Danas 

Publication date: 18 November 2009

Recommendations

• Recognizability in \(m\times n\)-polypodes. I.
• Recognizability and \(m \times n\)-polypodic automata. II
• Recognizability and \(m \times n\)-polypodic automata. I
• scientific article; zbMATH DE number 2140902
• scientific article; zbMATH DE number 1543313

zbMATH Keywords

\(m\times n\)-polypodesupper congruencesleft derivativespartial recognizabilityprojective recognizabilityupper recognizability

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Applications of universal algebra in computer science (08A70) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35) (n)-ary systems ((nge 3)) (20N15)

Cited In (6)

• Recognizability and \(m \times n\)-polypodic automata. I
• Recognizability and \(m \times n\)-polypodic automata. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognition of \(d\)-dimensional Monge arrays
• Recognizability in \(m\times n\)-polypodes. I.

This page was built for publication: Recognizability in \(m\times n\)-polypodes. II.

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