Title :
Two-way balloon automata and AFL
Author :
Ginsburg, Seymour ; Hopcroft, John
Abstract :
It is shown that if the family of languages accepted by a closed class of two-way balloon automata is closed under length-preserving homomorphism, then this family is an AFL closed under intersection and ε-free substitution. It is then proved that the family of languages accepted by the closed class of (nonerasing) (deterministic) stack acceptors is such a family.
Keywords :
Automata; Forward contracts; Laboratories; Storage automation;
Conference_Titel :
Switching and Automata Theory, 1968., IEEE Conference Record of 9th Annual Symposium on
Conference_Location :
Schenedtady, NY, USA
DOI :
10.1109/SWAT.1968.41
