### Mappings of languages by two-tape devicesMappings of languages by two-tape devices

Access Restriction
Subscribed

 Author Ginsburg, Seymour ♦ Spanier, Edwin H. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1965 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract Several devices with two input lines and one output line are introduced. These devices are viewed as transformations which operate on pairs of (ALGOL-like) languages. Among the results proved are the following: (i) a pair consisting of a language and a regular set is transformed into a language; (ii) let (V, W) be a pair consisting of a language and a regular set. Then the set of those words $\textit{w}1,$ for which there exists a word $\textit{w}2$ in $\textit{V}$ so that $(\textit{w}1,$ $\textit{w}2)$ is mapped into $\textit{W},$ is a language. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1965-07-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 12 Issue Number 3 Page Count 12 Starting Page 423 Ending Page 434

#### Open content in new tab

Source: ACM Digital Library