|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| T. Kameda, "R70-39 On the Relational Homomorphisms of Automata," IEEE Transactions on Computers, vol. 19, no. 10, pp. 987, October, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222812, author = {T. Kameda}, title = {R70-39 On the Relational Homomorphisms of Automata}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {10}, issn = {0018-9340}, year = {1970}, pages = {987}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222812}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - R70-39 On the Relational Homomorphisms of Automata IS - 10 SN - 0018-9340 SP EP EPD - 987 A1 - T. Kameda, PY - 1970 KW - null VL - 19 JA - IEEE Transactions on Computers ER - | |||
Yeh (Information and Control, vol. 13, pp. 140?155, 1968). The concepts of homomorphism and substitution property have played an important role in the structure theory of complete deterministic automata. In this paper the author tries to extend them to the general case of incomplete nondeterministic automata.1
Citation:
T. Kameda, "R70-39 On the Relational Homomorphisms of Automata," IEEE Transactions on Computers, vol. 19, no. 10, pp. 987, Oct. 1970, doi:10.1109/T-C.1970.222812
Usage of this product signifies your acceptance of the Terms of Use.