Search For:

Displaying 1-4 out of 4 total
On the total length an experiment-I
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Zamir Bavel
Issue Date:November 1964
pp. 234-248
No summary available.
 
Reversibility in monadic algebras and automata
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Zamir Bavel, David E. Muller
Issue Date:October 1965
pp. 242-247
If we regard reversibility (in the intuitive sense) as the ability to return to a previous state, monadic algebras possess varying types and degrees of reversibility. In this paper, we define several properties of monadic algebras, each describing a type o...
 
Connectivity and Reversibility in Automata
Found in: Journal of the ACM (JACM)
By David E. Muller, Zamir Bavel
Issue Date:April 1970
pp. 231-240
The paper deals with computer time-sharing disciplines in which external priorities are introduced. For a computer system under a time-sharing discipline, the following priority disciplines are discussed: (a) head-of-the-line; (b) preemptive repeat; and (c...
     
Structure and Transition-Preserving Functions of Finite Automata
Found in: Journal of the ACM (JACM)
By Zamir Bavel
Issue Date:January 1968
pp. 135-158
Arbitrary finite automata are decomposed into their major substructures, the primaries. Several characterizations of homomorphisms, endomorphisms, isomorphisms, and automorphisms of arbitrary finite automata are presented via reduction to the primaries of ...
     
 1