scientific article

zbMATH Open0548.68047MaRDI QIDQ3340153

Max Kanovich

Publication date: 1983

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

zbMATH Keywords

depthbinary treesrooted treecontrol automatonhierarchical network of automataslow- downcomplexity of network realization of finite-automaton functions

Mathematics Subject Classification ID

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

Related Items (2)

The complexity of interacting automata ⋮ Title not available (Why is that?)

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)