|
|
| Line 1: |
Line 1: |
| {{Infobox scientist
| | Hi there, I am Alyson Boon although it is not the title on my beginning certification. For a whilst I've been in Alaska but I will have to transfer in a yr or two. Invoicing is what I do for a living but I've always wanted my personal company. I am truly fond of to go to karaoke but I've been using on new things recently.<br><br>My web page - [http://findyourflirt.net/index.php?m=member_profile&p=profile&id=117823 online psychic readings] |
| |name = Seymour Ginsburg
| |
| |birth_date = December 12, 1927<ref name="b">[[Allen G. Debus]] (ed.): ''World Who’s who in Science: A Biographical Dictionary of Notable Scientists from Antiquity to the Present.'' Marquis Who’s Who, Chicago 1968, S. 658.</ref>
| |
| |birth_place = [[Brooklyn]]<ref name="b" />
| |
| |residence = [[United States|U.S.]]
| |
| |nationality = U.S.
| |
| |death_date = December 5, 2004
| |
| |field = [[Computer Science]]
| |
| |work_institution = [[University of Southern California]],<br>[[University of Miami]]
| |
| |alma_mater = [[CCNY|City College of New York]],<br>[[UM|University of Michigan]]
| |
| |doctoral_advisor = [[Dushnik-Miller dimension|Ben Dushnik]]|
| |
| |known_for = [[formal language theory|Formal Language Theory]],<br>[[Abstract Families of Languages]],<br>[[Database]] theory,<br>[[Object Histories]]
| |
| |religion = [[Jewish]]
| |
| }}
| |
| | |
| '''Seymour Ginsburg''' (1927–2004) was a pioneer of [[automata]] theory, [[formal language]] theory, and
| |
| [[database]] theory, in particular; and [[computer science]], in general. His work was influential in distinguishing theoretical Computer Science from the disciplines of Mathematics and Electrical Engineering.
| |
| | |
| During his career, Ginsburg published over 100 papers and three books on various topics in theoretical Computer Science.
| |
| | |
| == Biography ==
| |
| | |
| Seymour Ginsburg received his B.S. from [[CCNY|City College of New York]] in 1948, where along with fellow student [[Martin Davis]] he attended an honors mathematics class taught by [[Emil Post]].<ref>{{Citation |last=Urquhart|first=Alasdair|editor1-last=Gabbay|editor1-first=Dov M. |editor2-last=Woods|editor2-first=John|chapter=Emil Post|series=Handbook of the History of Logic|title=Logic from Russell to Church|volume=5|publisher=North Holland|publication-date=2009|isbn= 978-0-444-51620-6}}</ref> He earned a Ph.D. in [[Mathematics]] from the [[UM|University of Michigan]] in 1952, studying under [[Dushnik-Miller dimension|Ben Dushnik]].
| |
| | |
| Ginsburg's professional career began in 1951 when he accepted a position as Assistant Professor of Mathematics at the [[University of Miami]] in Florida. He turned his attention wholly towards [[Computer Science]] in 1955, when he moved to California to work for the [[Northrop Corporation]]. He followed this with positions at the [[National Cash Register Corporation]], [[Hughes Aircraft]], and [[System Development Corporation]].
| |
| | |
| At SDC, Ginsburg first concentrated on the theory of abstract machines.<ref>{{Citation|first=Seymour|last=Ginsburg|journal=Commun. ACM|volume=4|issue=4|year=1961|pages=195}}</ref> He subsequently formed and led a research project dedicated to formal language theory and the foundations of Computer Science. Members of the research group included: [[Sheila Greibach]], [[Mike Harrison]], Gene Rose, [[Ed Spanier]], and [[Joe Ullian]]. The work that came out of this group distinguished Computer Science theory from other fields, putting Ginsburg at the center of what became the theoretical Computer Science community.<ref name=memory>{{Citation|last1=Abiteboul|first1=S.|author1-link=Serge Abiteboul|last2=Hull|first2=R.|last3=Vianu|first3=V.|author3-link=Victor Vianu|title=In memory of Seymour Ginsburg, 1928-2004|journal=ACM SIGMOD Record|volume=34|issue=1|date=March 2005}}</ref>
| |
| | |
| It was during the SDC years that a young [[Jeff Ullman]] spent one summer working for Ginsburg, learning both formal language theory and a broad approach to research in Computer Science theory. [[Al Aho]] credited Ullman's summer with Ginsburg as being highly influential on Aho's career in Computer Science. In an interview, Aho recalled that there was little Computer Science at Princeton while he was studying for his PhD. However, after Ullman returned from his summer with Ginsburg, he stated that Ullman "essentially taught [[John Hopcroft|Hopcroft]], and me, formal language theory".<ref>[http://www.princeton.edu/~hos/mike/transcripts/aho.htm An interview of Al Aho by Professor M.S. Mahoney]</ref>
| |
| | |
| Ginsburg joined the faculty of [[University of Southern California]] in 1966 where he helped to establish the [[Computer Science]] department in 1968. He was awarded a [[Guggenheim Fellowship]] in 1974 and spent the year touring the world, lecturing on the areas of theoretical Computer Science which he had helped to create. Ginsburg was named the first Fletcher Jones Professor of Computer Science at USC in 1978, a chair he held until his retirement in 1999. He continued his work on formal language theory and automata through the 1970s.
| |
| | |
| At USC in the 1980s, Ginsburg created a research group dedicated to [[Database]] theory. He organized the first PODS ([[Symposium on Principles of Database Systems]]) in [[Marina del Rey]] in 1982 and was a moving force at the conference into the 1990s. He was honored with a surprise session at the 1992 PODS on the occasion of his 64th birthday. A festschrift edited by [[Jeff Ullman]] was created in his honor for the occasion.<ref>{{Citation|title=To Seymour Ginsburg on the occasion of his <math>2^6</math> birthday|series=Theoretical Studies in Computer Science|publisher=Academic Press|year=1992|isbn=0-12-708240-9|editor=Jeff Ullman}}</ref>
| |
| | |
| Ginsburg's career ended suddenly in 1999 when he was diagnosed with the onset of [[Alzheimer's disease]]. He retired from active teaching and became Professor Emeritus of Computer Science at USC. He spent his last years in declining health until dying on December 5, 2004.
| |
| | |
| Ginsburg was remembered fondly in a memorial published in the [[Association for Computing Machinery|ACM]] [[SIGMOD]] Record<ref name=memory/> in 2005. Beyond his contributions to Computer Science theory, he was remembered for the clarity of focus he brought to research and the seriousness with which he took his role as an advisor to PhD students. He was also remembered for his generous support of younger researchers. Those who benefitted from Ginsburg's mentorship, who were not also his PhD students, included: [[Jonathan Goldstine]], [[Sheila Greibach]], [[Michael Harrison]], [[Richard Hull (computer scientist)|Richard Hull]], and [[Jeff Ullman]].
| |
| | |
| == Professional Contributions ==
| |
| | |
| Ginsburg's early work concentrated on [[automata theory]]. In 1958, he proved that "[[don't-care]]" circuit minimization does not necessarily yield a minimal result.<ref>{{Citation|doi=10.1145/320964.320983|last=Ginsburg|first=Seymour|title=On the Reduction of Superfluous States in a Sequential Machine|journal=J. ACM|year=1959|volume=6|issue=2|pages=259–282}}</ref> His work in automata theory led the switching theory community into a more theoretical direction. This work culminated in the publication of a book on the mathematics of machines in 1962.<ref>{{Citation|first=Seymour|last=Ginsburg|title=Introduction to Mathematical Machine Theory|publisher=Addison Wesley|year=1962}}</ref>
| |
| | |
| Ginsburg turned his attention to [[formal language theory]] in the 1960s. He studied [[context-free grammar]]s and published a well-known comprehensive overview of context-free languages in 1966.<ref>{{Citation|last=Ginsburg|first=Seymour|title=The Mathematical Theory of Context-free Languages|year=1966|publisher=McGraw-Hill|publication-place=New York, San Francisco, St. Louis, Toronto, London, Sydney}}</ref> Ginsburg was the first to observe the connection between [[context-free language]]s and "[[ALGOL]]-like" languages.<ref>{{Citation|doi=10.1145/321127.321132|last=Ginsburg|first=Seymour|last2=Rice|first2=H. Gordon|title=Two Families of Languages Related to ALGOL|journal=J. ACM|volume=9|issue=3|year=1962|pages=350–371}}</ref> This brought the field of [[formal language theory]] to bear on [[programming language]] research. Ginsburg's results on context-free grammars and push-down acceptors are considered to be some of the deepest and most beautiful in the area. They remain standard tools for many computer scientists working in the areas of formal languages and automata.<ref name=memory/> Many of his papers at this time were co-authored with other prominent formal language researchers, including [[Sheila Greibach]], and [[Michael A. Harrison]].
| |
| | |
| The unification of different views of formal systems was a constant theme in Ginsburg's work.<ref name=memory/> In formal language theory his papers examined the relationships between grammar-based systems, acceptor-based systems, and algebraic characterizations of families of languages. The culmination of this work was the creation of one of the deepest branches of [[Computer Science]], [[Abstract Families of Languages]], in collaboration with [[Sheila Greibach]] in 1967.<ref>{{Citation|first1=Seymour|last1=Ginsburg|first2=Sheila A.|last2=Greibach|title=Abstract Families of Languages|journal=FOCS|year=1967|pages=128–139}}</ref><ref>{{Citation|first=Seymour|last=Ginsburg|title='Algebraic and automata theoretic properties of formal languages|publisher=North-Holland|year=1975|isbn=0-7204-2506-9}}</ref>
| |
| | |
| In 1974, Ginsburg, along with Armin Cremers, developed the theory of Grammar Forms.<ref>{{Citation|doi=10.1145/321812.321817|first1=Armen|last1=Gabrielian|first2=Seymour|last2=Ginsburg|title=Grammar Schemata|journal=J. ACM|volume=21|issue=2|year=1974|pages=213–226}}</ref><ref>{{Citation|first1=Armin B.|last1=Cremers|last2=Ginsburg|first2=Seymour|title=Context-Free Grammar Forms|journal=Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29 - August 2, 1974, Proceedings|editor=Jacques Loeckx|publisher=Springer|series=Lecture Notes in Computer Science|volume=14|year=1974|isbn=3-540-06841-4}}</ref><ref>{{Citation|last=Ginsburg|first=Seymour|title=A survey of grammar forms - 1977|journal=Acta Cybern.|volume=3|year=1977|pages=269–280}}</ref>
| |
| | |
| In the 1980s, Ginsburg became an early pioneer in the field of [[Database]] Theory. He continued to work in this field until his retirement. His professional contributions spanned subjects as diverse as [[Functional dependency]],<ref>{{Citation|first1=Seymour|last1=Ginsburg|first2=Richard|last2=Hull|title=Characterization for Functional Dependency and Boyce-Codd Normal Form Databases|journal=XP2 Workshop on Relational Database Theory|year=1981}}</ref><ref>{{Citation|doi=10.1145/322326.322331|last1=Ginsburg|first1=Seymour|first2=Sami Mohammed|last2=Zaiddan|title= Properties of functional-dependency families|journal=J. ACM|volume=29|issue=3|year=1982|pages=678–698}}</ref> object histories,<ref>{{Citation|doi=10.1145/5922.5924|first1=Seymour|last1=Ginsburg|first2=Katsumi|last2=Tanaka|title=Computation-Tuple Sequences and Object Histories|journal=ACM Trans. Database Syst.|volume=11|issue=2|year=1986|pages=186–212}}</ref> spreadsheet histories,<ref>{{Citation|first1=Seymour|last1=Ginsburg|first2=Stephen|last2=Kurtzman|title=Object-History and Spreadsheet P-Simulation|journal=ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31 - September 2, 1988, Proceedings|editor1=Marc Gyssens|editor2=Jan Paredaens|editor3=Dirk Van Gucht|series=Lecture Notes in Computer Science|volume=326|year=1988|pages=383–395|isbn=3-540-50171-1|publisher=Springer}}</ref> [[Datalog]],<ref>{{Citation|doi=10.1016/0304-3975(90)90015-A|first1=Guozhu|last1=Dong|first2=Seymour|last2=Ginsburg|title=On the Decomposition of Datalog Program Mappings|journal=Theor. Comput. Sci.|volume=76|issue=1|year=1990|pages=143–177}}</ref> and data restructuring.<ref>{{Citation|last1=Ginsburg|first1=Seymour|first2=Nan C.|last2=Shu|first3=Dan A.|last3=Simovici|title=Automatic Data Restructuring|journal=J. UCS|volume=5|issue=4|year=1999|pages=243–299}}</ref>
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| | |
| ==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]
| |
| * {{MathGenealogy |id= 5121}}
| |
| | |
| {{Authority control|VIAF=80383414}}
| |
| {{Persondata <!-- Metadata: see [[Wikipedia:Persondata]]. -->
| |
| | NAME = Ginsburg, Seymour
| |
| | ALTERNATIVE NAMES =
| |
| | SHORT DESCRIPTION =
| |
| | DATE OF BIRTH = 1927-12-12
| |
| | PLACE OF BIRTH = [[Brooklyn]]
| |
| | DATE OF DEATH = 2004-12-05
| |
| | PLACE OF DEATH =
| |
| }}
| |
| {{DEFAULTSORT:Ginsburg, Seymour}}
| |
| [[Category:1927 births]]
| |
| [[Category:2004 deaths]]
| |
| [[Category:American computer scientists]]
| |
| [[Category:Theoretical computer scientists]]
| |
| [[Category:City College of New York alumni]]
| |
| [[Category:University of Miami faculty]]
| |
| [[Category:University of Michigan alumni]]
| |
| [[Category:University of Southern California faculty]]
| |
| [[Category:Guggenheim Fellows]]
| |
Hi there, I am Alyson Boon although it is not the title on my beginning certification. For a whilst I've been in Alaska but I will have to transfer in a yr or two. Invoicing is what I do for a living but I've always wanted my personal company. I am truly fond of to go to karaoke but I've been using on new things recently.
My web page - online psychic readings