Mappings of languages by two-tape devices

Authors:
Seymour Ginsburg;Edwin H. Spanier
Affiliations:
System Development Corporation, Santa Monica, Calif.;University of California at Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
1965

Citing 4
Cited 15

Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Operations Which Preserve Definability in Languages

Journal of the ACM (JACM)
Quotients of Context-Free Languages

Journal of the ACM (JACM)
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory

Reasoning about strings in databases

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of expressions allowing concurrency

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An algebraic system for process structuring and interprocess communication

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the formulation of normal pushdown acceptors

ACM '68 Proceedings of the 1968 23rd ACM national conference
Synchronized shuffles

Theoretical Computer Science
Synchronized Shuffle on Backbones

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Infinite unfair shuffles and associativity

Theoretical Computer Science
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Linear process algebra

ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Compositional verification of asynchronous processes via constraint solving

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Synchronized Shuffle on Backbones

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Tree shuffle

Theoretical Computer Science
Unshuffling a square is NP-hard

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

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 w1, for which there exists a word w2 in V so that (w1, w2) is mapped into W, is a language.