Sequence generators, graphs, and formal languages,
dc.contributor.author | Burks, Arthur W. (Arthur Walter) | en_US |
dc.contributor.author | Wright, Jesse B. (Jesse Bowdle) | en_US |
dc.date.accessioned | 2006-04-13T14:54:22Z | |
dc.date.available | 2006-04-13T14:54:22Z | |
dc.date.issued | 1962-09 | en_US |
dc.identifier.citation | Burks, Arthur W., Wright, Jesse B. (1962/09)."Sequence generators, graphs, and formal languages, ." Information and Control 5(3): 204-212. <http://hdl.handle.net/2027.42/32290> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B7MFM-4DX494G-4W/2/bb9c284bfaf9b648d6466ba97307f3e8 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/32290 | |
dc.description.abstract | A sequence generator is a finite graph, more general than, but akin to, the usual state diagram associated with a finite automaton. The nodes of a sequence generator represent complete states, and each node is labeled with an input and an output state. An element of the behavior of a sequence generator is obtained by taking the input and output states along an infinite path of the graph.Sequence generators may be associated with formulas of the monadic predicate calculus, in which the individual variables range over the times 0, 1, 2, 3, [middle dot][middle dot][middle dot], and the predicate variables represent complete states, input states, and output states. An unrestricted singulary recursion is a formula in which the complete state at time [tau] + 1 is expressed as a truth-function of the complete state at time [tau] and the input states from times [tau] + 1 to [tau] + h. Necessary and sufficient conditions are given for a formula derived from a sequence generator being equivalent to an unrestricted singulary recursion. | en_US |
dc.format.extent | 465689 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Sequence generators, graphs, and formal languages, | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Philosophy, University of Michigan, Ann Arbor, Michigan, USA | en_US |
dc.contributor.affiliationum | Logic of Computers Group, University of Michigan, Ann Arbor, Michigan, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/32290/1/0000357.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0019-9958(62)90544-2 | en_US |
dc.identifier.source | Information and Control | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.