3 Hits in 1.1 sec

Referenced automata and metaregular families

R.M. Baer, E.H. Spanier
1969 Journal of computer and system sciences (Print)  
Referenced automata and metaregular sets have been studied by Agasandyan [1] and by Salomaa [5] . Our main interest is in the metaregular families.  ...  The scheme of the paper is as follows: In Section 1 we define the notions of referenced automata, metaregular sets, and families of metaregular sets (metaregular families); and we show that the nondeterministic  ... 
doi:10.1016/s0022-0000(69)80030-9 fatcat:xxv6hipjqjew3musyhedqgdrdq

Page 575 of Mathematical Reviews Vol. 41, Issue 2 [page]

1971 Mathematical Reviews  
Referenced automata and metaregular families. J. Comput. System Sci. 3 (1969), 423-446. A referenced automaton is a finite automaton with an additional read-only reference (oracle) tape.  ...  Referenced automata turn out to be equivalent to the time-variant automata previously studied by G. A. Agasandjan [Studies in the theory of self- adjusting systems (Russian), pp. 138-167, Vyéisl.  ... 

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
., April 1969; CFSTI, AD 698 499, $3.00. 7913 Referenced Automata and Metaregular Families, R. M. Baer and E. H. Spanier (U. California, Berkeley); J. Comput. Syst.  ...  7912 Referenced Automata and Metaregular Families 7913 Deciding the Complexity of Sets Defined by Arbitrary Automata 7914 Algebraic Decomposition of Automata 7915 General Theory of Translation  ... 
doi:10.1109/t-c.1970.223067 fatcat:fmxgtckr5vcivhopuosht7gszu