On complexity of formal coding method for analysis of generator with monocycle substitutional transition function

MaRDI QIDQ5146140zbMATH OpenFDO

Authors V. M. Fomichev

Publication date 25 January 2021

Full work available at URL http://mathnet.ru/eng/pdm77

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• On complexity of formal coding method for analysis of generator with monocycle substitutional transition function
• On the complexity of finite autonomous Moore automata
• scientific article; zbMATH DE number 3846884
• scientific article; zbMATH DE number 4077126
• On the complexity of analysis of automata over a finite ring

Cites work

• Efficient algorithms for solving overdefined systems of multivariate polynomial equations

Cited in

(1)

• On complexity of formal coding method for analysis of generator with monocycle substitutional transition function

This page was built for publication: On complexity of formal coding method for analysis of generator with monocycle substitutional transition function

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