Floyd, Robert W.Overview
Publication Timeline
Most widely held works about
Robert W Floyd
Most widely held works by
Robert W Floyd
The language of machines : an introduction to computability and formal languages
by Robert W Floyd
(
Book
)
6 editions published between 1993 and 1994 in English and held by 303 libraries worldwide
Die Sprache der Maschinen
by Robert W Floyd
(
Book
)
2 editions published in 1996 in German and held by 32 libraries worldwide
Addition machines
by Robert W Floyd
(
Book
)
5 editions published in 1989 in English and held by 17 libraries worldwide An addition machine is a computing device with a finite number of registers, limited to the following six types of operations:
Paradigms of programing
by Robert W Floyd
(
Recording
)
1 edition published in 1979 in English and held by 9 libraries worldwide
Notes on programming and the ALGOL W language
by Robert W Floyd
(
Book
)
1 edition published in 1970 in English and held by 7 libraries worldwide
The compilation of regular expressions into integrated circuits
by Robert W Floyd
(
Book
)
3 editions published in 1980 in English and held by 6 libraries worldwide
Toward interactive design of correct programs
by Robert W Floyd
(
Book
)
2 editions published in 1971 in English and held by 4 libraries worldwide
The Compilation of Regular Expressions into Integrated Circuits
(
Book
)
2 editions published in 1980 in Undetermined and English and held by 3 libraries worldwide We consider the design of integrated circuits to implement arbitrary regular expressions. In general, we may use the McNaughton-Yamada 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).
Le langage des machines : introduction à la calculibilité et aux langages formels
by Robert W Floyd
(
Book
)
1 edition published in 1995 in French and held by 3 libraries worldwide
A linear time two tape merge
by Robert W Floyd
(
Book
)
1 edition published in 1972 in English and held by 3 libraries worldwide
New proofs of old theorems in logic and formal linguistics
by Robert W Floyd
(
Book
)
2 editions published between 1965 and 1966 in English and held by 2 libraries worldwide
The language of machines : an introduction to computability and formal language
by Robert W Floyd
(
Book
)
1 edition published in 1994 in English and held by 2 libraries worldwide
New proofs of old theorems in logic and formal linguistics
(
Book
)
1 edition published in 1966 in English and held by 2 libraries worldwide Theorem 1 constructs, from any word problem in a semi-Thue 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 semi-Thue 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 Bose-Nelson sorting problem
by Robert W Floyd
(
Book
)
1 edition published in 1970 in English and held by 2 libraries worldwide
toward interactive design of correct programs
(
Book
)
1 edition published in 1971 in Undetermined and held by 1 library worldwide
A Linear Time Two Tape Merge
(
Book
)
1 edition published in 1972 in Undetermined and held by 1 library worldwide
The Language of Machines : An Introduction to Computability and Formal Languages
(
Book
)
1 edition published in 1994 in English and held by 1 library worldwide
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 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 direction-finding 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.
Information system theory project. volume ii. collected research papers
(
Book
)
1 edition published in 1965 in English and held by 1 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).
BOUNDED CONTEX SYNTACTIC ANALYSIS
(
Book
)
1 edition published in 1963 in English and held by 1 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). more
fewer
Audience Level
 Related IdentitiesAssociated Subjects
ALGOL (Computer program language) Automatic programming (Computer science) Backgammon Computable functions Computational linguistics Computer algorithms Computer logic Computer networks Computer programming Computer programs--Correctness Computer science Computer storage devices Education--Curricula Ethernet (Local area network system) Feigenbaum, Edward A Floyd, Robert W Formal languages Forsythe, George E.--1917- Golub, Gene H.--1932-2007 Herriot, John George,--1916- Integrated circuits Knuth, Donald Ervin,--1938- List processing (Electronic computers) Machine theory McCarthy, John,--1927- Memory management (Computer science) Microcomputer workstations Miller, William F Programming (Mathematics) Programming languages (Electronic computers) Registers (Computers) Sorting (Electronic computers) Stanford University Wiederhold, Gio
|
Alternative Names
Floyd, Robert.
Languages
Covers
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
