Two types of nonlinear automata over a finite ring

DOI10.1007/S10559-009-9123-3zbMath1185.68399OpenAlexW2028357116MaRDI QIDQ1040420

J. Blot

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9123-3

zbMATH Keywords

parametric identificationfixed pointstate identificationequivalent states

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Statistically equivalent mappings of finite sets ⋮ On the complexity of analysis of automata over a finite ring ⋮ Unnamed Item

Cites Work

• Nonlinear automata over a finite ring
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two types of nonlinear automata over a finite ring