Recognizability and m n-polypodic automata. I

zbMATH Open1259.68137MaRDI QIDQ4903877FDOQ4903877

Authors: George Danas 

Publication date: 28 January 2013

Recommendations

• Recognizability and \(m \times n\)-polypodic automata. II
• Recognizability in \(m\times n\)-polypodes. II.
• Recognizability in \(m\times n\)-polypodes. I.
• Construction of regular languages and recognizability of polynomials
• scientific article; zbMATH DE number 1839467

zbMATH Keywords

\(m \times n\)-polypode\(m\times n\)-polypodic automatonminimal \(m \times n\)-polypodic automatonpolypodic and lower congruencesrecognizable subset of an \(m \times n\)-polypodereducible equivalence

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (4)

• Recognizability for automata
• Recognizability and \(m \times n\)-polypodic automata. II
• Recognizability in \(m\times n\)-polypodes. II.
• Recognizability in \(m\times n\)-polypodes. I.

This page was built for publication: Recognizability and \(m \times n\)-polypodic automata. I

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