Joseph S. Ullian

According to our database, Joseph S. Ullian authored at least 12 papers between 1960 and 1978.

Collaborative distances:

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

1978

Annual Meeting of the Association for Symbolic Logic: Saint Louis, 1977.

Jon Barwise, Kenneth Kunen, Joseph S. Ullian

J. Symb. Log., 1978

1972

Meeting of the Association for Symbolic Logic: St. Louis 1972.

Carl G. Jockusch Jr., Joseph S. Ullian, Robert B. Barrett Jr.

J. Symb. Log., 1972

1971

Three Theorems Concerning Principal AFLs.

Joseph S. Ullian

J. Comput. Syst. Sci., 1971

1970

Three Theorems on Abstract Families of Languages

Joseph S. Ullian

Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

1969

The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages

Joseph S. Ullian

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1967

Partial Algorithm Problems for Context Free Languages

Joseph S. Ullian

Inf. Control., 1967

1966

Failure of a Conjecture About Context Free Languages

Joseph S. Ullian

Inf. Control., February, 1966

The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages.

Thomas N. Hibbard, Joseph S. Ullian

J. ACM, 1966

Preservation of unambiguity and inherent ambiguity in context-free languages.

Seymour Ginsburg, Joseph S. Ullian

J. ACM, 1966

Ambiguity in context free languages.

Seymour Ginsburg, Joseph S. Ullian

J. ACM, 1966

1961

A theorem on maximal sets.

Joseph S. Ullian

Notre Dame J. Formal Log., 1961

1960

Splinters of Recursive Functions.

Joseph S. Ullian

J. Symb. Log., 1960