Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Seymour Ginsburg
From Wikipedia, the free encyclopedia
| Born | 1928 |
|---|---|
| Died | 2004 |
| Residence | USA  |
| Nationality | US |
| Field | Computer Science |
| Institution | University of Southern California, University of Miami |
| Alma mater | City College of New York, University of Michigan |
| Academic advisor | Ben Dushnik |
| Notable students | Gary Miles Richard Flemming |
| Known for | Formal Language Theory, Abstract Families of Languages, Object Histories |
| Religion | Jewish |
Seymour Ginsburg (1928-2004) was a pioneer of automata theory, formal language theory, and database theory in particular; and computer science in general.
Professor Ginsburg received his B.S. from City College of New York in 1948 and his Ph.D. in Mathematics from the University of Michigan in 1952. He was a Professor of Mathematics at the University of Miami in Florida from 1951 to 1955. In 1955, he turned his attention towards Computer Science when he started working in private industry. In 1966, he joined the faculty of University of Southern California and helped to establish the Computer Science department in 1968. He was awarded a Guggenheim Fellowship in 1974. He was named the first Fletcher Jones Professor of Computer Science at USC in 1978, a chair he held until his retirement in 1999.
Professor Ginsburg published over 100 papers and three books. His early work concentrated on finite state automata. In the 1960s, he studied context-free grammars, being the first to observe the connection between context-free languages and "ALGOL-like" languages. This brought the field of formal language theory to bear on programming language research. Many of his papers at this time were co-authored with other prominent formal language researchers, including Sheila Greibach, and Michael A. Harrison. His collaboration with Sheila Greibach led to their joint creation of one of the deepest and most elegant branches of Computer Science, Abstract Families of Languages in 1967. In 1974, Professor Ginsburg, along with Ph.D. student Armin Cremers, developed the theory of Grammar Forms.
In the 1980s, Professor Ginsburg became an early pioneer in the field of Database Theory. He continued to work in this field until his retirement. His results spanned diverse subjects as Functional dependency, object histories, spreadsheet histories, Datalog, and data restructuring.
- List of publications from the DBLP Bibliography Server
- Seymour Ginsburg at the Mathematics Genealogy Project
 |
This computer-related article is a stub. You can help Wikipedia by expanding it. |