Seymour Ginsburg

Seymour Ginsburg

Infobox_Scientist
name = Seymour Ginsburg
birth_date = 1928
residence = U.S.
nationality = US
death_date = 2004
field = Computer Science
work_institution = University of Southern California,
University of Miami
alma_mater = City College of New York,
University of Michigan
doctoral_advisor = Ben Dushnik
doctoral_students =
George Mager
William Chandler
Joseph Giuliano
Donald Kiel
Branislav Rovan
David Mizell
Gary Miles
Richard Flemming
Sammy Zaidan
Victor VIanu
Serge Abiteboul
Timothy Connors
Guozhu Dong
Dan Tian
Stephen Kurtzman
Xiaoyang Wang
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.

External links

* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Ginsburg:Seymour.html List of publications from the DBLP Bibliography Server]
*


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Sheila Greibach — (1939 ) is a researcher in formal languages, automata, compiler theory in particular; and computer science in general. She is currently Professor of Computer Science at the University of California, Los Angeles.She worked with Seymour Ginsburg… …   Wikipedia

  • Famille abstraite de langages — En informatique théorique, et en particulier en théorie des langages formels, le terme famille abstraite de langages réfère à une notion qui généralise des caractéristiques communes aux langage rationnels, aux langages algébriques, aux langages… …   Wikipédia en Français

  • Ginsberg — Ginsberg, Ginsburg, Ginsburgh, Ginsparg, Ginzberg, Ginzborg, and Ginzburg are variants of the same surname.Ginsberg* Allen Ginsberg, a Beat poet * Asher Hirsch Ginsberg ( Achad ha am ), Zionist writer and philosopher * Benjamin Ginsberg… …   Wikipedia

  • Transduction rationnelle — En informatique théorique, en linguistique, en théorie des automates et en théorie des langages, une transduction rationnelle est une transformation de mots et de langages définie par un transducteur fini ou au moyen d une relation rationnelle.… …   Wikipédia en Français

  • Cone (formal languages) — In formal language theory, a cone is a set of formal languages that has some desirable closure properties enjoyed by some well known sets of languages, in particular by the families of regular languages, context free languages and the recursive… …   Wikipedia

  • Гинзбург — Содержание 1 Этимология 2 Мужчины 2.1 A 2.2 В …   Википедия

  • Abstract family of languages — An abstract family of languages is a grouping of formal languages such that the membership of a language in a given family is proven by its sharing of specific characteristics with the languages already known to be of that family. A family must… …   Wikipedia

  • Abstract family of acceptors — An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor… …   Wikipedia

  • Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… …   Wikipedia

  • Serge Abiteboul — Infobox Scientist name = Serge Abiteboul image width = caption = birth date = birth place = death date = death place = residence = citizenship = French nationality = French ethnicity = field = Computer Science work institution = INRIA alma mater …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”