Examples of Abstract Machines
- 1 April 1962
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-11 (2) , 132-135
- https://doi.org/10.1109/tec.1962.5219345
Abstract
Numerous physical situations related to data processing are shown to be modeled by a mathematical entity called a quasi-machine. The situations described include 1) single inputs producing multiple outputs, 2) machines yielding no outputs upon insertion of certain inputs, 3) the retention of the last n outputs only, 4) ``erase left'' on tape, 5) different input routines doing the same work, and 6) certain types of asynchronous switching circuits. The first five may be modeled by quasi-machines with a special property, such quasi-machines being called abstract machines.Keywords
This publication has 6 references indexed in Scilit:
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960
- Some remarks on abstract machinesTransactions of the American Mathematical Society, 1960
- Synthesis of Minimal-State MachinesIEEE Transactions on Electronic Computers, 1959
- Realization of Events by Logical NetsJournal of the ACM, 1958
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955
- The synthesis of sequential switching circuitsJournal of the Franklin Institute, 1954