Floyd, Robert W.
Overview
Works:  28 works in 59 publications in 3 languages and 443 library holdings 

Roles:  Author, Editor 
Classifications:  QA267.3, 511.3 
Publication Timeline
.
Most widely held works about
Robert W Floyd
 The living legends: a discussion about the establishment of the Computer Science Department at Stanford University :( )
 Stanford University, Dept. of Computer Science, records by Stanford University( )
Most widely held works by
Robert W Floyd
The language of machines : an introduction to computability and formal languages by
Robert W Floyd(
Book
)
13 editions published between 1993 and 1994 in English and held by 325 WorldCat member libraries worldwide
13 editions published between 1993 and 1994 in English and held by 325 WorldCat member libraries worldwide
Die Sprache der Maschinen by
Robert W Floyd(
Book
)
3 editions published in 1996 in German and held by 48 WorldCat member libraries worldwide
3 editions published in 1996 in German and held by 48 WorldCat member libraries worldwide
Addition machines by
Robert W Floyd(
Book
)
6 editions published in 1989 in English and Undetermined and held by 18 WorldCat member libraries worldwide
Read x {input to register x} x < y {copy register y to register x} x < x + y {add register y to register x} x < x  y {subtract register y from register x} if x>= y {compare register x to register y} write x {output from register x}
6 editions published in 1989 in English and Undetermined and held by 18 WorldCat member libraries worldwide
Read x {input to register x} x < y {copy register y to register x} x < x + y {add register y to register x} x < x  y {subtract register y from register x} if x>= y {compare register x to register y} write x {output from register x}
The Compilation of Regular Expressions into Integrated Circuits by
Robert W Floyd(
Book
)
6 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughtonYamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device directly. First, we could produce a PLA (programmable logic array) of approximate dimensions 4n x 4n by representing the states directly by columns, rather than coding the states in binary. This approach, while theoretically suboptimal, makes use of carefully developed technology and, because of the care with which PLA implementation has been done, may be the preferred technique in many real situations. Another approach is to use the hierarchical structure of the automation produced from the regular expression to guide a hierarchical layout of the circuit. This method produces a circuit 0(square root of n) on a side and is, to within a constant factor, the best that can be done in general. (Author)
6 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughtonYamada algorithm to convert a regular expression of length n into a nondeterministic finite automation with at most 2n states and 4n transitions. Instead of converting the nondeterministic device to a deterministic one, we propose two ways of implementing the nondeterministic device directly. First, we could produce a PLA (programmable logic array) of approximate dimensions 4n x 4n by representing the states directly by columns, rather than coding the states in binary. This approach, while theoretically suboptimal, makes use of carefully developed technology and, because of the care with which PLA implementation has been done, may be the preferred technique in many real situations. Another approach is to use the hierarchical structure of the automation produced from the regular expression to guide a hierarchical layout of the circuit. This method produces a circuit 0(square root of n) on a side and is, to within a constant factor, the best that can be done in general. (Author)
Notes on programming and the ALGOL W language by
Robert W Floyd(
Book
)
2 editions published in 1970 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1970 in English and held by 7 WorldCat member libraries worldwide
Paradigms of programing by
Robert W Floyd(
Recording
)
1 edition published in 1979 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1979 in English and held by 6 WorldCat member libraries worldwide
Toward interactive design of correct programs by
Robert W Floyd(
Book
)
4 editions published in 1971 in English and Undetermined and held by 5 WorldCat member libraries worldwide
4 editions published in 1971 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Le Langage des machines : introduction à la calculabilité et aux langages formels by
Robert W Floyd(
Book
)
1 edition published in 1995 in French and held by 3 WorldCat member libraries worldwide
1 edition published in 1995 in French and held by 3 WorldCat member libraries worldwide
New proofs of old theorems in logic and formal linguistics by
Robert W Floyd(
Book
)
3 editions published between 1964 and 1966 in English and held by 3 WorldCat member libraries worldwide
3 editions published between 1964 and 1966 in English and held by 3 WorldCat member libraries worldwide
A linear time two tape merge by
Robert W Floyd(
Book
)
2 editions published in 1972 in Undetermined and English and held by 2 WorldCat member libraries worldwide
2 editions published in 1972 in Undetermined and English and held by 2 WorldCat member libraries worldwide
The BoseNelson sorting problem by
Robert W Floyd(
Book
)
1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1970 in English and held by 2 WorldCat member libraries worldwide
New proofs of old theorems in logic and formal linguistics(
Book
)
1 edition published in 1966 in English and held by 2 WorldCat member libraries worldwide
Theorem 1 constructs, from any word problem in a semiThue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semiThue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author)
1 edition published in 1966 in English and held by 2 WorldCat member libraries worldwide
Theorem 1 constructs, from any word problem in a semiThue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semiThue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author)
The language of machines : an introduction to compatibility and formal languages(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
BOUNDED CONTEX SYNTACTIC ANALYSIS(
Book
)
1 edition published in 1963 in English and held by 1 WorldCat member library worldwide
Certain phrase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded contex of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic analysis of sentences in a bounded context language may be performed by a standard process, and requires a number of operations proportional to the length of sentence analyzed. Bounded context grammars form models for most languages used in computer programming, and many mehtods of syntactic analysis, including analysis by operator precedence, are special cases of bounded context analysis. (Author)
1 edition published in 1963 in English and held by 1 WorldCat member library worldwide
Certain phrase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded contex of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic analysis of sentences in a bounded context language may be performed by a standard process, and requires a number of operations proportional to the length of sentence analyzed. Bounded context grammars form models for most languages used in computer programming, and many mehtods of syntactic analysis, including analysis by operator precedence, are special cases of bounded context analysis. (Author)
Directional Guidance Method for the Blind Using Time Separation Pitch Discrimination of Triple Pulse Signals(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
One of the most difficult problems in orientation and mobility training with blind people is that subjects veer either to the left or to the right while attempting to walk a straight path. This veering tendency is most pronounced when attempting to traverse an open area in the absence of consistent tactile or auditory cues. We propose a training method in which a blind person receives continuous feedback while walking along a predetermined line. This method was designed to allow immediate recognition and correction of deviations from the straight path. The laboratory simulation of the training method involved detecting delays between sound pulses by observing changes in time separation pitch (TSP). TSP is a perceived pitch resulting from hearing at least two highly correlated, broadband pulses. (For example, the pulses could have the same shape or the second pulse could be the inverse of the first). We hypothesized that an observer could follow a line by listening to the TSP perceived from two stationary, spatially separated and synchronized pulse transmitters, one producing the first and third pulses and the other transmitter producing the second pulse, thus forming a pulse triplet. The success of such a directionfinding system for the blind depends on the ability of the subject to recognize deviations from the line and to return to the line. We performed psychoacoustic experiments using signals simulating stimuli that a subject would hear while traveling on or near the line defined by three coordinated pulses
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
One of the most difficult problems in orientation and mobility training with blind people is that subjects veer either to the left or to the right while attempting to walk a straight path. This veering tendency is most pronounced when attempting to traverse an open area in the absence of consistent tactile or auditory cues. We propose a training method in which a blind person receives continuous feedback while walking along a predetermined line. This method was designed to allow immediate recognition and correction of deviations from the straight path. The laboratory simulation of the training method involved detecting delays between sound pulses by observing changes in time separation pitch (TSP). TSP is a perceived pitch resulting from hearing at least two highly correlated, broadband pulses. (For example, the pulses could have the same shape or the second pulse could be the inverse of the first). We hypothesized that an observer could follow a line by listening to the TSP perceived from two stationary, spatially separated and synchronized pulse transmitters, one producing the first and third pulses and the other transmitter producing the second pulse, thus forming a pulse triplet. The success of such a directionfinding system for the blind depends on the ability of the subject to recognize deviations from the line and to return to the line. We performed psychoacoustic experiments using signals simulating stimuli that a subject would hear while traveling on or near the line defined by three coordinated pulses
Nondeterministic algorithms by
Robert W Floyd(
Book
)
1 edition published in 1966 in English and held by 1 WorldCat member library worldwide
1 edition published in 1966 in English and held by 1 WorldCat member library worldwide
On syntactic analysis and operator precedence(
Book
)
1 edition published in 1962 in English and held by 1 WorldCat member library worldwide
1 edition published in 1962 in English and held by 1 WorldCat member library worldwide
Annual review in automatic programming(
Book
)
1 edition published in 1969 in English and held by 1 WorldCat member library worldwide
1 edition published in 1969 in English and held by 1 WorldCat member library worldwide
La langage des machines : introduction a la calculabilité et aux langages formales by
Robert W Floyd(
Book
)
1 edition published in 1995 in French and held by 1 WorldCat member library worldwide
1 edition published in 1995 in French and held by 1 WorldCat member library worldwide
Information system theory project. volume ii. collected research papers(
Book
)
1 edition published in 1965 in English and held by 1 WorldCat member library worldwide
This report contains the working papers developed under contract AF30(602)3324 which was addressed to the development of a coherent mathematical foundation for information systems. Papers include Notes on Compiling Techniques and the TGS Translator Generator System by Thomas E. Cheatham, AMBIT: A programming Language for Algebraic Symbol Manipulation and Examples of Symbol Manipulation in the AMBIT Programming Language by Carlos Christianson, The Syntax of Programming Languages, A Survey, Flowchart Levels, NonDeterministic Algorithm and several algorithms and proofs of algorithms by Robert Floyd and An Environment for an Operating System by G.F. Leonard and J.R. Goodroe. (Author)
1 edition published in 1965 in English and held by 1 WorldCat member library worldwide
This report contains the working papers developed under contract AF30(602)3324 which was addressed to the development of a coherent mathematical foundation for information systems. Papers include Notes on Compiling Techniques and the TGS Translator Generator System by Thomas E. Cheatham, AMBIT: A programming Language for Algebraic Symbol Manipulation and Examples of Symbol Manipulation in the AMBIT Programming Language by Carlos Christianson, The Syntax of Programming Languages, A Survey, Flowchart Levels, NonDeterministic Algorithm and several algorithms and proofs of algorithms by Robert Floyd and An Environment for an Operating System by G.F. Leonard and J.R. Goodroe. (Author)
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
ALGOL (Computer program language) Automatic programming (Computer science) Computable functions Computational linguistics Computer algorithms Computer logic Computer networks Computer programming Computer programsCorrectness Computer science Computer storage devices Ethernet (Local area network system) Feigenbaum, Edward A Floyd, Robert W Formal languages Forsythe, George E.(George Elmer), Golub, Gene H.(Gene Howard), Herriot, John G.(John George), Integrated circuits Knuth, Donald Ervin, List processing (Electronic computers) Logic, Symbolic and mathematical Machine theory Mathematical linguistics McCarthy, John, Memory management (Computer science) Microcomputer workstations Miller, William F Programming (Mathematics) Programming languages (Electronic computers) Registers (Computers) Sorting (Electronic computers) Stanford University.Computer Science Department Wiederhold, Gio
Alternative Names
Floyd, Robert.
Robert Flojd
Robert Floyd americk informatik
Robert Floyd amerikanischer Informatiker
Robert Floyd informaticien amricain
Robert Floyd informatico statunitense
Robert W. Floyd amerikansk ingenir og informatikar
Robert W. Floyd amerikansk ingenir og informatiker
Robert W. Floyd amerikansk ingenjr och datavetare
Robert W. Floyd informatyk amerykański
Роберт Флојд
Флойд, Роберт
רוברט פלויד
رابرت فلوید دانشمند علوم کامپیوتر و مهندس آمریکایی
روبرت فلويد
রবার্ট বব ফ্লয়েড
โรเบิร์ต ฟลอยด์
로버트 플로이드
ロバート・フロイド
罗伯特弗洛伊德
罗伯特弗洛伊德 美国计算机科学家
Languages
Covers