On the automata functional systems

DOI10.1515/DMA.1995.5.5.397zbMATH Open0851.68075OpenAlexW4243442734MaRDI QIDQ4889720FDOQ4889720

Authors: Valerii B. Kudryavtsev 

Publication date: 12 August 1996

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

Full work available at URL: https://doi.org/10.1515/dma.1995.5.5.397

Recommendations

• scientific article; zbMATH DE number 5005932
• Undecidability of the completeness and A-completeness problems for some systems of automaton functions
• scientific article; zbMATH DE number 468641

zbMATH Keywords

automata functional systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• Complexity of automata computing values of functions given in the prefix form
• On solutions to systems of automata-type functional equations
• Memoryless systems generate the class of all discrete systems
• The classes of automata embeddable to pre-complete classes
• Title not available (Why is that?)

This page was built for publication: On the automata functional systems

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