Author of the publication

Parallel Random Access Machines with Powerful Instruction Sets.

. Math. Syst. Theory, 15 (3): 191-210 (1982)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Maze Recognizing Automata (Extended Abstract). STOC, page 151-156. ACM, (1972)Parallel Random Access Machines with Powerful Instruction Sets.. Math. Syst. Theory, 15 (3): 191-210 (1982)The Turing Degree of the Inherent Ambiguity Problem for Context-Free Languages., and . Theor. Comput. Sci., 1 (1): 77-91 (1975)Graphs of Processors.. Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, page 418-425. Springer, (1978)Teaching Ada by the book: the pedagogy of Ada in CS1., , , , , and . SIGCSE, page 385-386. ACM, (1994)Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract). STOC, page 247-248. ACM, (1969)A Formal Model for Context-Free Languages Augmented with Reduplication.. Computational Linguistics, 15 (4): 250-261 (1989)Consistency in Nondeterministic Storage., and . J. Comput. Syst. Sci., 29 (1): 118-132 (1984)Writing a textbook: walking the gauntlet., , , and . SIGCSE, page 408-409. ACM, (2001)Ambiguous Developmental Plans.. Automata, Languages, Development, page 293-300. North-Holland Publishing Company, (1975)