Conditions of a-completeness for linear automata over dyadic rationals

DOI10.1515/DMA-2021-0016OpenAlexW3176346472MaRDI QIDQ2050227

Dmitriy V. Ronzhin

Publication date: 30 August 2021

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2021-0016

zbMATH Keywords

finite automatalinear automatadyadic rationals\(A\)-completenessmaximal subclasses

Mathematics Subject Classification ID

Computer science (68-XX) Systems theory; control (93-XX)

Cites Work

• Completeness problem for the class of linear automata functions
• Unnamed Item

This page was built for publication: Conditions of a-completeness for linear automata over dyadic rationals