Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

J. Richard Büchi

View through CrossRef
Abstract Julius Richard Büchi was born in Porto Allegre, Brazil, on 31 January 1924 to Swiss parents and as a citizen of Zell, Switzerland. He grew up in Switzerland and in 1948 received a doctoral degree in mathematics from the Eidgenössische Technische Hochschule in Zurich; his thesis supervisor was Paul Bernays. After graduation he moved almost immediately to the United States and had a number of academic appointments, among others at the University of Michigan, Ann Arbor. In 1963 he became Professor of Mathematics and Computer Science at Purdue University and retained that position until his death in 1984. Büchi did important work in mathematical logic and, relatedly, theoretical computer science. Dirk Siefkes states in his 1985 that Büchi is “probably best known for using finite automata as combinatorial devices to obtain strong results on decidability and definability in monadic second-order theories and extending the method to infinite combinatorial tools”. Büchi’s papers were collected by Mac Lane and Siefkes in Büchi 1990; his posthumously published book Finite automata, their algebras and grammars was edited by Siefkes.
Oxford University PressOxford
Title: J. Richard Büchi
Description:
Abstract Julius Richard Büchi was born in Porto Allegre, Brazil, on 31 January 1924 to Swiss parents and as a citizen of Zell, Switzerland.
He grew up in Switzerland and in 1948 received a doctoral degree in mathematics from the Eidgenössische Technische Hochschule in Zurich; his thesis supervisor was Paul Bernays.
After graduation he moved almost immediately to the United States and had a number of academic appointments, among others at the University of Michigan, Ann Arbor.
In 1963 he became Professor of Mathematics and Computer Science at Purdue University and retained that position until his death in 1984.
Büchi did important work in mathematical logic and, relatedly, theoretical computer science.
Dirk Siefkes states in his 1985 that Büchi is “probably best known for using finite automata as combinatorial devices to obtain strong results on decidability and definability in monadic second-order theories and extending the method to infinite combinatorial tools”.
Büchi’s papers were collected by Mac Lane and Siefkes in Büchi 1990; his posthumously published book Finite automata, their algebras and grammars was edited by Siefkes.

Related Results

Photochemical approaches for the synthesis of oxygen- and sulphur-containing heterocycles
Photochemical approaches for the synthesis of oxygen- and sulphur-containing heterocycles
Approches photochimiques pour la synthèse d'hétérocycles oxygénés et soufrés Les oxétanes sont des cycles à quatre chaînons comportant un atome d’oxygène intracycli...
LTL transformation modulo positive transitions
LTL transformation modulo positive transitions
In this study, the author presents a new efficient algorithm for translating linear temporal logic (LTL) formulas to Büchi automata, which are used by LTL model checkers. The gener...
Plasma AR Alterations and Timing of Intensified Hormone Treatment for Prostate Cancer
Plasma AR Alterations and Timing of Intensified Hormone Treatment for Prostate Cancer
This randomized clinical trial explores whether hormone intensification at start of androgen deprivation therapy alters selection of androgen receptor (AR) gene alterations within ...
Paterno‐Büchi Reaction
Paterno‐Büchi Reaction
AbstractThis reaction is a photo‐induced [2 + 2] cycloaddition of carbonyl compounds with olefins or other unsaturated substrates to form four‐membered cyclic ethers, known as oxet...
Richard Pring (1938-2024): una filosofía de la educación realista y profunda
Richard Pring (1938-2024): una filosofía de la educación realista y profunda
Richard Pring nació en Sheffield el 20 de abril de 1938 y falleció serenamente el 6 de octubre de 2024 en su casa de Oxford, rodeado del cariño de su familia. Miembro del Green Tem...
No good Markov strategies for Büchi objectives in countable MDPs
No good Markov strategies for Büchi objectives in countable MDPs
Abstract We study countably infinite Markov decision processes with Büchi objectives, which ask to visit a given subset of states infinitely ...

Back to Top