Edwin H. Spanier

According to our database, Edwin H. Spanier authored at least 14 papers between 1963 and 1985.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1985

On Completing Tables to Satisfy Functional Dependencies.

Seymour Ginsburg, Edwin H. Spanier

Theor. Comput. Sci., 1985

1983

On the Equality of Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1983

1982

A Prime Decomposition Theorem for Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1982

1977

Pushdown Acceptor Forms.

Seymour Ginsburg, Edwin H. Spanier

Theor. Comput. Sci., 1977

The Structure of Context-Free Grammatical Families.

Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1977

1975

Substitution of Grammar Forms.

Seymour Ginsburg, Edwin H. Spanier

Acta Informatica, 1975

1974

On Incomparable Abstract Family of Languages (AFL).

Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1974

1971

AFL with the Semilinear Property.

Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1971

1970

Substitution in families of languages.

Seymour Ginsburg, Edwin H. Spanier

Inf. Sci., 1970

1969

Referenced Automata and Metaregular Families.

Robert M. Baer, Edwin H. Spanier

J. Comput. Syst. Sci., 1969

1968

Control Sets on Grammars.

Seymour Ginsburg, Edwin H. Spanier

Math. Syst. Theory, 1968

Derivation-Bounded Languages

Seymour Ginsburg, Edwin H. Spanier

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1964

Mappings of languages by two-tape devices

Seymour Ginsburg, Edwin H. Spanier

Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, 1964

1963

Quotients of Context-Free Languages.

Seymour Ginsburg, Edwin H. Spanier

J. ACM, 1963