scientific article; zbMATH DE number 3874616

zbMATH Open0548.68047MaRDI QIDQ3340153FDOQ3340153

Authors: Max Kanovich 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 468642
• scientific article; zbMATH DE number 4078823
• scientific article; zbMATH DE number 1270383
• scientific article; zbMATH DE number 1355187
• On the complexity of finite autonomous Moore automata

zbMATH Keywords

binary treesdepthrooted treecontrol automatonhierarchical network of automataslow- downcomplexity of network realization of finite-automaton functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (5)

• Title not available (Why is that?)
• The complexity of interacting automata
• Sequentialization and procedural complexity in automata networks
• Title not available (Why is that?)
• Computation on binary tree-networks

This page was built for publication:

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