Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Seymour Ginsburg

Theory of Computation

Seymour Ginsburg, born December 12, 1927 and died December 5, 2004, was an American pioneer of automata theory, formal language theory and database theory in particular, and of computer science in general. His work was influential in distinguishing theoretical computer science from the disciplines of mathematics and electrical engineering, and during his career he published over 100 papers and three books on topics in theoretical computer science.

Facts
Birth Year
1927 1
Birth Date
1927-12-12 2
Death Year
2004 2
Death Date
2004-12-05 2
Nationality
American 2
Award
Guggenheim Fellowship 1
FAQs

How did Seymour Ginsburg connect formal language theory to programming languages?

He was the first to note that context-free languages match Algol-like programming languages.

Noam Chomsky introduced context-free grammars to model natural languages. Ginsburg was the first to note the connection between context-free languages and Algol-like computer languages specified in Backus normal form. That link brought formal language theory to the center of programming language research.
Connections

Associated With

Source Wikipedia: Seymour Ginsburg

In Field

Source Wikipedia: Seymour Ginsburg
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikidata: Seymour Ginsburg
  • Wikidata Q92797, class allow-list match (w-wdresolver-0926)
  • Wikidata Q92797 P569 (date of birth)
2. Wikipedia: Seymour Ginsburg
Wikimedia Foundation
  • Lead section
    Seymour Ginsburg (December 12, 1927 - December 5, 2004) was an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general.
  • Associated With: Context-Free Grammar, Biography section
    He studied context-free grammars and published a well-known comprehensive overview of context-free languages in 1966.
  • In Field: Theory of Computation, Lead paragraph
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.