On the public citation graph
Automata theory and structural design problems of digital machines
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1017/s0305004100028322openalex-snapshot
Micro-programming and the design of the control circuits in an electronic digital computer
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4939-0476-1_1openalex-snapshot
Theoretical and Applied Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-03998-5_2openalex-snapshot
Theory of Interaction, Insertion Modeling, and Cognitive Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-13206-8_6openalex-snapshot
On Algebraic Properties of Nominative Data and Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-24912-4_1openalex-snapshot
Insertion Modeling and Symbolic Verification of Large Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-67229-8_16openalex-snapshot
Formalization of the Nominative Algorithmic Algebra in Mizar
inferred← citeshttps://doi.org/10.1007/978-3-642-34274-5_38openalex-snapshot
Insertion Cognitive Architecture
inferred← citeshttps://doi.org/10.1007/bf01068485openalex-snapshot
Abstract synthesis of multiregister automata on the basis of microprograms
inferred← citeshttps://doi.org/10.1007/bf01068498openalex-snapshot
A basic system of microoperations and its use
inferred← citeshttps://doi.org/10.1007/bf01068581openalex-snapshot
Practical methods for the recognition of the equivalence of discrete processors and program schemata
inferred← citeshttps://doi.org/10.1007/bf01068710openalex-snapshot
Infinite generation criteria in universal algebras
inferred← citeshttps://doi.org/10.1007/bf01069796openalex-snapshot
Realization of the means of algorithmic algebras in homogeneous structures
inferred← citeshttps://doi.org/10.1007/bf01070415openalex-snapshot
Theory of data structures and synchronous parallel computations
inferred← citeshttps://doi.org/10.1007/bf01070419openalex-snapshot
Complex systems and simulation models
inferred← citeshttps://doi.org/10.1007/bf01070431openalex-snapshot
Discrete systems and problems of their realization. I
inferred← citeshttps://doi.org/10.1007/bf01070497openalex-snapshot
Functional equivalence of discrete processors. II
inferred← citeshttps://doi.org/10.1007/bf01070658openalex-snapshot
Algebras of periodically defined transformations of an infinite register
inferred← citeshttps://doi.org/10.1007/bf01070676openalex-snapshot
Languages for automated computer-design systems (PROEKT)
inferred← citeshttps://doi.org/10.1007/bf01071083openalex-snapshot
Functional equivalence of discrete processors. I
inferred← citeshttps://doi.org/10.1007/bf01071355openalex-snapshot
Theory of automata and certain problems of synthesizing the structures of language processors
inferred← citeshttps://doi.org/10.1007/bf01071356openalex-snapshot
Discrete systems and problems of their realization. II
inferred← citeshttps://doi.org/10.1007/bf01071370openalex-snapshot
Automated imitation models of complex systems
inferred← citeshttps://doi.org/10.1007/bf01071404openalex-snapshot
The equivalence of automata with a terminal state. I
inferred← citeshttps://doi.org/10.1007/bf01071417openalex-snapshot
Automata theory and formal microprogram transformations
inferred← citeshttps://doi.org/10.1007/bf01071495openalex-snapshot
The ?Assembly-line? principle of information processing
inferred← citeshttps://doi.org/10.1007/bf01071592openalex-snapshot
On the automation of computer design
inferred← citeshttps://doi.org/10.1007/bf01071794openalex-snapshot
Infinitely generated subalgebras of a modified post algebra
inferred← citeshttps://doi.org/10.1007/bf01071799openalex-snapshot
The algebra of multiregister operators
inferred← citeshttps://doi.org/10.1007/bf01071813openalex-snapshot
A system for solving logical problems on Minsk computers
inferred← citeshttps://doi.org/10.1007/bf01073051openalex-snapshot
Questions of functional completeness for a modification of Boolean algebra
inferred← citeshttps://doi.org/10.1007/bf01073238openalex-snapshot
Structure of modified Post algebra and its properties
inferred← citeshttps://doi.org/10.1007/bf01073672openalex-snapshot
A class of equivalent transformations of operator schemes. I
inferred← citeshttps://doi.org/10.1007/bf01073934openalex-snapshot
Problems of completeness in Boolean function algebras
inferred← citeshttps://doi.org/10.1007/bf01074693openalex-snapshot
An algorithm for economical memory utilization
inferred← citeshttps://doi.org/10.1007/bf01078747openalex-snapshot
Optimization of cycle-free automata with a terminal state
inferred← citeshttps://doi.org/10.1007/bf01267881openalex-snapshot
The performance of multiplication by means of an operation unit based on the conveyor principle of data processing
inferred← citeshttps://doi.org/10.1007/bf02742065openalex-snapshot
Functional completeness in iterative meta-algebras
inferred← citeshttps://doi.org/10.1007/bf02911258openalex-snapshot
A general theory of action languages
inferred← citeshttps://doi.org/10.1007/s10559-009-9159-4openalex-snapshot
Composition-nominative aspects of address programming
inferred← citeshttps://doi.org/10.1016/0045-7906(80)90034-8openalex-snapshot
A new methodology to computer system design
inferred← citeshttps://doi.org/10.1016/j.bica.2014.03.001openalex-snapshot
Theory of interaction, insertion modeling, and cognitive architectures
inferred← citeshttps://doi.org/10.1023/b:casa.0000003501.97990.e5openalex-snapshot
Glushkov Algebras and Clone Theory
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1195129openalex-snapshot
Don't cares in logic minimization of extended finite state machines
inferred← citeshttps://doi.org/10.1109/t-c.1970.222797openalex-snapshot
Functional Microprogramming as a Logic Design Aid
inferred← citeshttps://doi.org/10.1109/tc.1976.1674537openalex-snapshot
Microprogram Optimization: A Survey
inferred← citeshttps://doi.org/10.1145/1119772.1119951openalex-snapshot
Don't cares in logic minimization of extended finite state machines
inferred← citeshttps://doi.org/10.1145/800118.803847openalex-snapshot
A survey of techniques to reduce/minimize the control part/rom of a microprogrammed digital computer
inferred← citeshttps://doi.org/10.15407/akademperiodyka.367.192openalex-snapshot
Algebra-Algorithmic Models and Methods of Parallel Programing
inferred← citeshttps://doi.org/10.15407/dopovidi2017.02.016openalex-snapshot
Модельне проектування процесора
inferred← citeshttps://doi.org/10.15407/pp2017.03.019openalex-snapshot
Formal and adaptive methods and software tools of parallel programming
inferred← citeshttps://doi.org/10.34229/2707-451x.23.4.2openalex-snapshot
Algebraic School of V.M. Glushkov and Insertion Modeling
inferred← citeshttps://doi.org/10.4018/978-1-5225-9384-3.ch001openalex-snapshot
Algebras of Algorithms, Parallel Computing, and Software Auto-Tuning
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1000/icteri-2013-p-004-015-inv-3.pdfopenalex-snapshot
General Theory of Interaction and Cognitive Architectures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.