Multitape AFA
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (2) , 193-221
- https://doi.org/10.1145/321694.321695
Abstract
Device representations, via multitape AFA (abstract families of acceptors), are given for the families of languages which result from applying the wedge (A) m)d the substitu- tion operations to AFL (abstract families of languages). In particular, if ~ and ~2 are multi- tape AFA (i.e. certain families of multistorage tape acceptors), then 5)~ A ~2 is defined as the family of multitape acceptors which results when the tapes of ~ and ~2 are coalesced, with the ~-tapes preceding those in ~2 . It is shown that the smallest full AFL containing 2(~) A 2 (~D2) = {L~ N L2 ILi in2 (~Di) } is ,12 (~ h~:). For each multitape AFAr, aset ~.v of "nested" multitape acceptors is defined. It is shown that if ~ and ~2 are single-tape AFA, then the family of languages obtained from (~ A ~2) N is the family of langnages obtained by substitut- ing the AFL defined by ~2 into the AFL defined by ~D~ .Keywords
This publication has 18 references indexed in Scilit:
- Images of AFL under certain families of homomorphismsTheory of Computing Systems, 1971
- Substitution in families of languagesInformation Sciences, 1970
- Nested Stack AutomataJournal of the ACM, 1969
- Derivation-bounded languagesJournal of Computer and System Sciences, 1968
- Counter machines and counter languagesTheory of Computing Systems, 1968
- One-way nondeterministic real-time list-storage languagesJournal of the ACM, 1968
- Control sets on grammarsTheory of Computing Systems, 1968
- One-way stack automataJournal of the ACM, 1967
- Turing machines with restricted memory accessInformation and Control, 1966
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966