Find link

language:

Find link is a tool written by Edward Betts.

searching for Switching circuit theory 14 found (30 total)

alternate case: switching circuit theory

Symposium on Foundations of Computer Science (534 words) [view diff] case mismatch in snippet view article find links to article

paper in FOCS. In 1960–1965, FOCS was known as the Symposium on Switching Circuit Theory and Logical Design, and in 1966–1974 it was known as the Symposium

Juris Hartmanis (2,501 words) [view diff] case mismatch in snippet view article find links to article

Computational complexity of recursive sequences. 5th Ann. Symp. on Switching Circuit Theory and Logical Design. Princeton, New Jersey: IEEE. pp. 82–90. doi:10

Nathaniel Rochester (computer scientist) (711 words) [view diff] exact match in snippet view article

organized a group to study pattern recognition, information theory and switching circuit theory, headed by Rochester. Among other projects, the group simulated

Arden's rule (352 words) [view diff] case mismatch in snippet view article find links to article

"Delayed Logic and Finite State Machines". Proc. 2nd Ann. Symp. on Switching Circuit Theory and Logical Design (SWCT), Detroit/MI. (open-access abstract) John

Muller automaton (648 words) [view diff] case mismatch in snippet view article find links to article

"Infinite sequences and finite machines". 4th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT): 3–16. Automata on Infinite Words Slides

David E. Muller (647 words) [view diff] case mismatch in snippet view article find links to article

"Infinite sequences and finite machines". 4th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT): 3–16. doi:10.1109/SWCT.1963.8. David

Busy beaver (7,603 words) [view diff] exact match in snippet view article find links to article

was published in the proceedings of the 1964 IEEE symposium on switching circuit theory and logical design. Heiner Marxen and Jürgen Buntrock described

Regular language (3,420 words) [view diff] case mismatch in snippet view article find links to article

computations. Proceedings of the 6th Annual IEEE Symposium on Switching Circuit Theory and Logic Design, pp. 179–190. 1965. "How to prove that a language

Table of the largest known graphs of a given diameter and maximal degree (1,130 words) [view diff] case mismatch in snippet view article find links to article

interconnection-limited logic", 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp. 133–137, doi:10.1109/SWCT.1964.27 Gómez

Sheila Greibach (1,329 words) [view diff] case mismatch in snippet view article find links to article

free languages. In Proceedings of the Sixth Annual Symposium on Switching Circuit Theory and Logical Design, pages 203-220. IEEE, 1965. Seymour Ginsburg

Two-way finite automaton (1,619 words) [view diff] case mismatch in snippet view article find links to article

of Memory Limited Computations". Proc. 6th Ann. IEEE Symp. on Switching Circuit Theory and Logical Design. pp. 179–190. Alfred V. Aho; John E. Hopcroft;

Brzozowski derivative (1,362 words) [view diff] no match in snippet view article find links to article

automata". In Robert S. Ledley (ed.). Proc. AIEE 2nd Ann. Symp. on Switching, Circuit Theory, and Logical Design (SWCT), Detroit. pp. 129–132. doi:10.1109/FOCS

Wolfgang Händler (2,177 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-11011700-4. (320 pages) Hotz, Günter (1974). Schaltkreistheorie [Switching circuit theory]. DeGruyter Lehrbuch (in German) (1 ed.). Walter de Gruyter & Co

List of Bell Labs alumni (1,137 words) [view diff] exact match in snippet view article find links to article

scientist and co-author of The Design of Switching Circuits on switching circuit theory. Father of Dennis M. Ritchie. Alfred Aho Advanced compiler theory