Recognizability in m n-polypodes. I.

zbMATH Open1172.20044MaRDI QIDQ5308299FDOQ5308299

Authors: George Danas 

Publication date: 27 September 2007

Recommendations

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

zbMATH Keywords

syntactic congruencesrecognizable subsets\(m\times n\)-polypodespolypodic congruencesleft derivatives

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 (3)

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

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

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