This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th Annual Symposium on Switching and Automata Theory (SWAT 1970)
Series-parallel irreducibility: Machine oriented definitions and proofs
October 28-October 30
ASCII Text
x 
 
Bernard P. Zeigler, "Series-parallel irreducibility: Machine oriented definitions and proofs," Foundations of Computer Science, IEEE Annual Symposium on, pp. 236-239, 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), 1970.
 
 
BibTex
x
 
@article{ 10.1109/SWAT.1970.21,
author = {Bernard P. Zeigler},
title = {Series-parallel irreducibility: Machine oriented definitions and proofs},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1970},
issn = {0272-4847},
pages = {236-239},
doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1970.21},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Series-parallel irreducibility: Machine oriented definitions and proofs
SN - 0272-4847
SP236
EP239
A1 - Bernard P. Zeigler,
PY - 1970
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
The aim of this paper is not the establishment of new results, but the understanding, from a machine theoretic point of view, of results originally arrived at by algebraic means. A new criterion for series parallel irreducibility is given which makes no reference to underlying semigroups but involves only series parallel operations. Also, the irreducibility of prime counter machines is established using only machine theoretic methods.
Citation:
Bernard P. Zeigler, "Series-parallel irreducibility: Machine oriented definitions and proofs," focs, pp.236-239, 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), 1970
Usage of this product signifies your acceptance of the Terms of Use.