On the public citation graph

An Introduction to Mathematical Machine Theory

https://doi.org/10.2307/2004142

0 signed · 110 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.

Claim with ORCID

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.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19730191404openalex-snapshot

Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen

inferred← citeshttps://doi.org/10.1002/zamm.19680480302openalex-snapshot

Die Automatentheorie als Teilgebiet der angewandten Mathematik

inferred← citeshttps://doi.org/10.1007/3-540-07142-3_61openalex-snapshot

A Categorist's view of automata and systems

inferred← citeshttps://doi.org/10.1007/3-540-07162-8_661openalex-snapshot

Sequential functions and generalized Moore and Mealy automata

inferred← citeshttps://doi.org/10.1007/3-540-53414-8_30openalex-snapshot

Subsequential functions: Characterizations, minimization, examples

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_83openalex-snapshot

Generalizing finiteness conditions of labelled transition systems

inferred← citeshttps://doi.org/10.1007/978-1-4613-8177-8_5openalex-snapshot

The Common Algebraic Structure of Exit-Automata and Machines

inferred← citeshttps://doi.org/10.1007/978-1-4615-8243-4_5openalex-snapshot

Logical Design of Optimal Digital Networks by Integer Programming

inferred← citeshttps://doi.org/10.1007/978-1-4615-8246-5_4openalex-snapshot

Some Grammars and Recognizers for Formal and Natural Languages

inferred← citeshttps://doi.org/10.1007/978-3-030-31566-5_12openalex-snapshot

Machine Learning and Artificial Intelligence: The Basis of Intelligent Machines in the Cyber Economy

inferred← citeshttps://doi.org/10.1007/978-3-322-92151-2_2openalex-snapshot

Der Mealy-Automat (MlA)

inferred← citeshttps://doi.org/10.1007/978-3-642-11120-4_2openalex-snapshot

Theory of Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-32332-4_5openalex-snapshot

Time in Hardware Modeling and Design

inferred← citeshttps://doi.org/10.1007/978-3-642-65586-9_4openalex-snapshot

Universelle Digital-Rechenanlagen

inferred← citeshttps://doi.org/10.1007/978-3-662-40393-8_4openalex-snapshot

Monitored Finite State Machines

inferred← citeshttps://doi.org/10.1007/978-3-663-04186-3_1openalex-snapshot

Die Informationsverarbeitung in der Unternehmung

inferred← citeshttps://doi.org/10.1007/978-94-010-1713-8_1openalex-snapshot

Further Remarks on the Pragmatics of Natural Languages

inferred← citeshttps://doi.org/10.1007/978-94-010-2867-7_1openalex-snapshot

Synthesis of the Tables

inferred← citeshttps://doi.org/10.1007/bf00288687openalex-snapshot

Der programmierbare endliche automat

inferred← citeshttps://doi.org/10.1007/bf00290336openalex-snapshot

A practical general method for constructing LR(k) parsers

inferred← citeshttps://doi.org/10.1007/bf01073234openalex-snapshot

On the formalization of the concept of an experiment with an automaton

inferred← citeshttps://doi.org/10.1007/bf01397085openalex-snapshot

Computing the ideal structure of finite semigroups

inferred← citeshttps://doi.org/10.1007/bf01695628openalex-snapshot

Minimal solutions of Paull-Unger problems

inferred← citeshttps://doi.org/10.1007/bf01695771openalex-snapshot

On categories of infinite automata

inferred← citeshttps://doi.org/10.1007/bf01940221openalex-snapshot

Finite synchronous automata

inferred← citeshttps://doi.org/10.1007/bf01951360openalex-snapshot

On a group-matrix type automaton with output

inferred← citeshttps://doi.org/10.1007/bf01966090openalex-snapshot

Construction of recognition devices for regular languages from their Backus Normal Form definition

inferred← citeshttps://doi.org/10.1007/bf02015376openalex-snapshot

Arithmetische Prädikate über einem Bereich endlicher Automaten

inferred← citeshttps://doi.org/10.1007/bf02194870openalex-snapshot

A mode of decomposition of regular languages

inferred← citeshttps://doi.org/10.1007/bf02235806openalex-snapshot

Eine Bemerkung zur Zustandsreduktion unvollständiger Automaten

inferred← citeshttps://doi.org/10.1007/bf02236540openalex-snapshot

Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen

inferred← citeshttps://doi.org/10.1007/bf02238820openalex-snapshot

The common algebraic structure of exit-automata and machines

inferred← citeshttps://doi.org/10.1007/bf02345486openalex-snapshot

Some results on the relation between automata and their automorphism groups

inferred← citeshttps://doi.org/10.1007/bf02476133openalex-snapshot

A programmed automaton for anesthesia control

inferred← citeshttps://doi.org/10.1007/bf02476831openalex-snapshot

Abstract biological systems as sequential machines

inferred← citeshttps://doi.org/10.1007/bf02476989openalex-snapshot

Abstract biological systems as sequential machines: Behavioral reversibility

inferred← citeshttps://doi.org/10.1007/bf02570794openalex-snapshot

Finiteness conditions for finitely generated monoids

inferred← citeshttps://doi.org/10.1007/bf02576628openalex-snapshot

Su un problema d'adattamento negli automi probabilistici

inferred← citeshttps://doi.org/10.1016/0004-3702(72)90048-3openalex-snapshot

On the inference of Turing machines from sample computations

inferred← citeshttps://doi.org/10.1016/0005-1098(66)90011-2openalex-snapshot

Automata theory and control theory—A rapprochement

inferred← citeshttps://doi.org/10.1016/0020-0255(69)90020-6openalex-snapshot

The state space in systems theory

inferred← citeshttps://doi.org/10.1016/0020-0255(77)90021-4openalex-snapshot

Canonical realization of general time systems

inferred← citeshttps://doi.org/10.1016/0020-0255(93)90084-yopenalex-snapshot

Data Machines and Standards, or the Functional Specification of Information Systems

inferred← citeshttps://doi.org/10.1016/0022-5193(68)90079-9openalex-snapshot

Mathematical models for cellular interactions in development I. Filaments with one-sided inputs

inferred← citeshttps://doi.org/10.1016/0025-5564(75)90125-xopenalex-snapshot

Fuzzy Neural Networks

inferred← citeshttps://doi.org/10.1016/0031-3203(68)90005-8openalex-snapshot

“Empyrean”, an alternative paradigm for pattern recognition

inferred← citeshttps://doi.org/10.1016/0304-3975(77)90055-xopenalex-snapshot

Sur une variante des fonctions sequentielles

inferred← citeshttps://doi.org/10.1016/0888-613x(91)90014-dopenalex-snapshot

Fuzzy acceptors for syntactic pattern recognition

inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.003openalex-snapshot

A survey of state vectors

inferred← citeshttps://doi.org/10.1016/j.jtbi.2016.08.007openalex-snapshot

Rosen's (M,R) system as an X-machine

inferred← citeshttps://doi.org/10.1016/j.scico.2005.09.001openalex-snapshot

A theory of computer instructions

inferred← citeshttps://doi.org/10.1016/s0016-0032(64)90583-6openalex-snapshot

On homomorphic images of transition graphs

inferred← citeshttps://doi.org/10.1016/s0019-9958(65)90316-5openalex-snapshot

Enumeration of strongly connected sequential machines

inferred← citeshttps://doi.org/10.1016/s0019-9958(66)80003-7openalex-snapshot

Turing machines with restricted memory access

inferred← citeshttps://doi.org/10.1016/s0019-9958(66)80011-6openalex-snapshot

The theory of sequential relations

inferred← citeshttps://doi.org/10.1016/s0019-9958(67)80006-8openalex-snapshot

A machine realization of the linear context-free languages

inferred← citeshttps://doi.org/10.1016/s0019-9958(68)90763-8openalex-snapshot

Generalized decomposition of incomplete finite automata

inferred← citeshttps://doi.org/10.1016/s0019-9958(68)91114-5openalex-snapshot

Some unsolvable problems on context-free languages and their application to on-line language recognizers

inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90552-9openalex-snapshot

Epimorphisms in certain categories of transducers

inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90217-5openalex-snapshot

Complete degrees of finite-state transformability

inferred← citeshttps://doi.org/10.1016/s0022-0000(67)80011-4openalex-snapshot

On some properties of the free monoids with applications to automata theory

inferred← citeshttps://doi.org/10.1016/s0022-0000(67)80027-8openalex-snapshot

Fuzzy star functions, probabilistic automata, and their approximation by nonprobabilistic automata

inferred← citeshttps://doi.org/10.1016/s0022-0000(70)80041-1openalex-snapshot

Tree acceptors and some of their applications

inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00039-0openalex-snapshot

Deterministic automata simulation, universality and minimality

inferred← citeshttps://doi.org/10.1049/el:19690489openalex-snapshot

Relationship between two concepts of equivalence for finite-state machines

inferred← citeshttps://doi.org/10.1051/m2an/196903r300451openalex-snapshot

Décomposition des langages réguliers

inferred← citeshttps://doi.org/10.1057/jors.1974.80openalex-snapshot

Bounding Distributions for Stochastic Logic Networks

inferred← citeshttps://doi.org/10.1068/b010125openalex-snapshot

A Theory of Markovian Design Machines

inferred← citeshttps://doi.org/10.1080/00029890.1965.11970707openalex-snapshot

A Perspective View of Discrete Automata and Their Design

inferred← citeshttps://doi.org/10.1080/00207179608921881openalex-snapshot

On the control of incompletely described sequential machines

inferred← citeshttps://doi.org/10.1080/00207727008920219openalex-snapshot

Brain models: a brief review†

inferred← citeshttps://doi.org/10.1080/0022250x.1971.9989789openalex-snapshot

A formalization of measurement scale forms

inferred← citeshttps://doi.org/10.1080/01969728108927670openalex-snapshot

AN AUTOMATA-THEORETICAL APPROACH TO DEVELOPING LEARNING NEURAL NETWORKS

inferred← citeshttps://doi.org/10.1080/07494467.2019.1578123openalex-snapshot

Math and Music, Models and Metaphors: Alberto Posadas' ‘Tree-Like Structures’

inferred← citeshttps://doi.org/10.1090/s0002-9939-1962-0138545-0openalex-snapshot

Output Completeness in Sequential Machines

inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0188316-1openalex-snapshot

Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0201228-xopenalex-snapshot

Products of Automata and the Problem of Covering

inferred← citeshttps://doi.org/10.1109/cdc.1994.411586openalex-snapshot

On some control problems in molecular biology

inferred← citeshttps://doi.org/10.1109/mahc.1990.10004openalex-snapshot

The Cellar Principle of State Transition and Storage Allocation

inferred← citeshttps://doi.org/10.1109/swat.1966.10openalex-snapshot

Generalized decomposition of incomplete finite automata

inferred← citeshttps://doi.org/10.1109/swct.1963.8openalex-snapshot

Infinite sequences and finite machines

inferred← citeshttps://doi.org/10.1109/t-c.1970.222939openalex-snapshot

Discrete-Time Systems with the Decomposition Property

inferred← citeshttps://doi.org/10.1109/t-c.1970.222944openalex-snapshot

An Improved Upper Bound for the Finite Delay of Graphs

inferred← citeshttps://doi.org/10.1109/tc.1976.1674564openalex-snapshot

A Realization Algorithm for Multiple Preset Experiments

inferred← citeshttps://doi.org/10.1109/tc.1978.1675053openalex-snapshot

Inference of Sequential Machines from Sample Computations

inferred← citeshttps://doi.org/10.1109/tct.1969.1082933openalex-snapshot

Invertibility, Equivalence, and the Decomposition Property of Abstract Systems

inferred← citeshttps://doi.org/10.1109/ycict.2009.5382390openalex-snapshot

Multi-behaviors Finite State Machine

inferred← citeshttps://doi.org/10.1145/321281.321290openalex-snapshot

Generation of Primes by a One-Dimensional Real-Time Iterative Array

inferred← citeshttps://doi.org/10.1145/321281.321293openalex-snapshot

Generalized Cascade Decompositions of Automata

inferred← citeshttps://doi.org/10.1145/321281.321294openalex-snapshot

Mappings of languages by two-tape devices

inferred← citeshttps://doi.org/10.1145/321328.321334openalex-snapshot

A Theory of Computer Instructions

inferred← citeshttps://doi.org/10.1145/321574.321577openalex-snapshot

Connectivity and Reversibility in Automata

inferred← citeshttps://doi.org/10.1145/355616.364037openalex-snapshot

On computing sets of shortest paths in a graph

inferred← citeshttps://doi.org/10.1145/356608.356610openalex-snapshot

A Programmer's View of Automata

inferred← citeshttps://doi.org/10.1145/362929.362976openalex-snapshot

Curriculum 68: Recommendations for academic programs in computer science

inferred← citeshttps://doi.org/10.1145/364005.364035openalex-snapshot

Mechanical languages

inferred← citeshttps://doi.org/10.1145/364005.364036openalex-snapshot

The place of logical design and switching theory in the computer curriculum

inferred← citeshttps://doi.org/10.1145/364139.364150openalex-snapshot

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

inferred← citeshttps://doi.org/10.1145/365559.366069openalex-snapshot

An undergraduate program in computer science—preliminary recommendations

inferred← citeshttps://doi.org/10.1145/365691.365962openalex-snapshot

Multi-tape and infinite-state automata—a survey

inferred← citeshttps://doi.org/10.1145/365719.366427openalex-snapshot

The construction of recognizers

inferred← citeshttps://doi.org/10.1145/800169.805426openalex-snapshot

Free groups and regular expressions

inferred← citeshttps://doi.org/10.1145/800197.806039openalex-snapshot

Invited papers---1

inferred← citeshttps://doi.org/10.1287/isre.9.3.275openalex-snapshot

Automating the Discovery of AS-IS Business Process Models: Probabilistic and Algorithmic Approaches

inferred← citeshttps://doi.org/10.1353/pbm.1965.0037openalex-snapshot

Self-Reproducing Automata

inferred← citeshttps://doi.org/10.20868/upm.thesis.987openalex-snapshot

Programas abiertos como principio del método de teoría en inteligencia artificial

inferred← citeshttps://doi.org/10.2206/kyushumfs.24.94openalex-snapshot

AN ALGEBRAIC PROOF OF KLEENE-MYHILL'S EQUIVALENCE THEOREM

inferred← citeshttps://doi.org/10.25596/jalc-2002-469openalex-snapshot

On the Number of Distinct Languages Accepted by Finite Automata with n States

inferred← citeshttps://doi.org/10.4153/cjm-1965-010-9openalex-snapshot

A Census of Finite Automata

inferred← citeshttps://doi.org/10.4171/automata-1/13openalex-snapshot

Enumerating regular expressions and their languages

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.