Join Us
Sign In
My Subscriptions
Magazines
Journals
Video Library
Conference Proceedings
Individual CSDL Subscriptions
Institutional CSDL Subscriptions
Resources
Career Center
Tech News
Resource Center
Press Room
Advertising
Librarian Resources
IEEE.org
Help
About Us
Career Center
Cart
Create Account
Sign In
Toggle navigation
My Subscriptions
Browse Content
Resources
All
Home
Proceedings
FOCS
FOCS 1967
Generate Citations
8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Oct. 18 1967 to Oct. 20 1967
Texas
Table of Contents
Papers
Table of contents
Freely available from IEEE.
pp. 4-6
Papers
Foreword
Freely available from IEEE.
pp. c3
Papers
Structural equivalence of context-free grammars
Full-text access may be available. Sign in or learn about subscription options.
pp. 7-13
by
M. C. Paull
,
S. H. Unger
Papers
Programmed grammars -- A new device for generating formal languages
Full-text access may be available. Sign in or learn about subscription options.
pp. 14-20
by
Daniel J. Rosenkrantz
Papers
Indexed grammars -- An extension of context free grammars
Full-text access may be available. Sign in or learn about subscription options.
pp. 21-31
by
Alfred V. Aho
Papers
An infinite hierarchy of context-free languages
Full-text access may be available. Sign in or learn about subscription options.
pp. 32-36
by
Sheila A. Greibach
Papers
Two results on one-way stack automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 37-44
by
J. E. Hopcroft
,
J. D. Ullman
Papers
On the structure of programming languages, or, six languages for turing machines
Full-text access may be available. Sign in or learn about subscription options.
pp. 45-54
by
Eric G. Wagner
Papers
Parallel program schemata: A mathematical model for parallel computation
Full-text access may be available. Sign in or learn about subscription options.
pp. 55-61
by
Richard M. Karp
,
Raymond E. Miller
Papers
Completely functional asynchronous computational structures
Full-text access may be available. Sign in or learn about subscription options.
pp. 62-70
by
Fred L. Luconi
Papers
The general synthesis problem for asynchronous digital networks
Full-text access may be available. Sign in or learn about subscription options.
pp. 71-82
by
David E. Muller
Papers
A parallel-acting iterative automaton
Full-text access may be available. Sign in or learn about subscription options.
pp. 83-94
by
S. M. Amoroso
Papers
Synthesis of asynchronous sequential circuits with minimum number of delay elements
Full-text access may be available. Sign in or learn about subscription options.
pp. 95-105
by
D. B. Armstrong
,
A. D. Friedman
,
P. R. Menon
Papers
Universal single transition time asynchronous state assignments
Full-text access may be available. Sign in or learn about subscription options.
pp. 106-111
by
Arthur D. Friedman
Papers
On the complexity of undecidable problems in automata theory
Full-text access may be available. Sign in or learn about subscription options.
pp. 112-116
by
J. Hartmanis
Papers
Turing machines with several read-write heads
Full-text access may be available. Sign in or learn about subscription options.
pp. 117-127
by
Albert R. Meyer
,
Arnold L. Rosenberg
,
Patrick C. Fischer
Papers
Abstract families of languages
Full-text access may be available. Sign in or learn about subscription options.
pp. 128-139
by
Seymour Ginsburg
,
Sheila Greibach
Papers
An approach to a unified theory of automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 140-147
by
J. E. Hopcroft
,
J. D. Ullman
Papers
Real time counter machines
Full-text access may be available. Sign in or learn about subscription options.
pp. 148-154
by
Patrick C. Fischer
,
Albert R. Meyer
,
Arnold L. Rosenberg
Papers
Automata on a 2-dimensional tape
Full-text access may be available. Sign in or learn about subscription options.
pp. 155-160
by
M. Blum
,
C. Hewitt
Papers
Testing for faults in combinational cellular logic arrays
Full-text access may be available. Sign in or learn about subscription options.
pp. 161-174
by
William H. Kautz
Papers
Two contributions to redundancy theory
Full-text access may be available. Sign in or learn about subscription options.
pp. 175-183
by
Theresa F. Klaschka
Papers
Decomposition of group functions and the synthesis of multirail cascades
Full-text access may be available. Sign in or learn about subscription options.
pp. 184-196
by
Bernard Elspas
,
Harold S. Stone
Papers
Generation of self-dual and self-complementary dual functions
Full-text access may be available. Sign in or learn about subscription options.
pp. 197-209
by
W. C. W. Mow
,
K. S. Fu
Papers
A cellular structure for sequential networks
Full-text access may be available. Sign in or learn about subscription options.
pp. 210-225
by
D. Ferrari
,
A. Grasselli
Papers
Inverse problems in coding, automata, and continuous systems
Full-text access may be available. Sign in or learn about subscription options.
pp. 226-232
by
James L. Massey
,
Michael K. Sain
Papers
Modular decomposition of synchronous sequential machines
Full-text access may be available. Sign in or learn about subscription options.
pp. 233-239
by
P. Weiner
,
J. E. Hopcroft
Papers
Memory-span concepts and the synthesis of sequential machines in feedback shift-register form
Full-text access may be available. Sign in or learn about subscription options.
pp. 240-251
by
Robert L. Martin
Papers
Generalized state identification problems
Full-text access may be available. Sign in or learn about subscription options.
pp. 251-254
by
E. L. Lawler
,
T. F. Piatkowski
Papers
On decompositions of regular events
Full-text access may be available. Sign in or learn about subscription options.
pp. 255-264
by
J. A. Brzozowski
,
Rina Cohen
Papers
On the star height of regular events
Full-text access may be available. Sign in or learn about subscription options.
pp. 265-279
by
Rina Cohen
,
J. A. Brzozowski
Papers
Fuzzy star functions, probabilistic automata and their approximation by nonprobabilistic automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 280-290
by
A. Paz
Papers
Computation times for finite groups, semigroups and automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 291-295
by
Philip M. Spira
,
Michael A. Arbib
Papers
Classes of automata and transitive closure
Full-text access may be available. Sign in or learn about subscription options.
pp. 296-306
by
Neil D. Jones
Papers
Irreducible decompositions of transformation graphs by assignment techniques
Full-text access may be available. Sign in or learn about subscription options.
pp. 307-313
by
C. M. Ablow
,
Michael Yoeli
,
James Turner
Papers
On endomorphisms and congruences of automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 314-321
by
R. Bayer
Papers
On the decomposability of monadic algebras and automata
Full-text access may be available. Sign in or learn about subscription options.
pp. 322-335
by
Zemir Bavel
,
James W. Thomas
Showing 37 out of 37