focs68.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>9. FOCS 1968: City, State</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>9. <a href="index.html">FOCS</a> 1968: City, State</h1> 9th Annual Symposium on Foundations of Computer Science, City, State, October 1968. IEEE Computer Society <ul> <li><a name="TanMF68" href="../../indices/a-tree/t/Tan:C=_J=.html">C. J. Tan</a>, <a href="../../indices/a-tree/m/Menon:Premachandran_R=.html">Premachandran R. Menon</a>, <a href="../../indices/a-tree/f/Friedman:Arthur_D=.html">Arthur D. Friedman</a>: Structural Simplification and Decomposition of Asynchronous Sequential Circuits. 7-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TanMF68">BibTeX</a></font> <li><a name="Kinney68" href="../../indices/a-tree/k/Kinney:Larry_L=.html">Larry L. Kinney</a>: A Characterization of Some Asynchronous State Assignments. 20-27 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kinney68">BibTeX</a></font> <li><a name="Schwartz68" href="../../indices/a-tree/s/Schwartz:Scott_J=.html">Scott J. Schwartz</a>: An Algorithm for Minimizing Read Only Memories for Machine Control. 28-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schwartz68">BibTeX</a></font> <li><a name="NiehC68" href="../../indices/a-tree/n/Nieh:T=_T=.html">T. T. Nieh</a>, <a href="../../indices/a-tree/c/Carlyle:Jack_W=.html">Jack W. Carlyle</a>: On a Measure of Complexity for Stochastic Sequential Machines. 34-41 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NiehC68">BibTeX</a></font> <li><a name="Paz68" href="../../indices/a-tree/p/Paz:Azaria.html">Azaria Paz</a>: Infinite State Probabilistic Transition Tables and Chains Ergodic Properties. 42-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Paz68">BibTeX</a></font> <li><a name="Cobham68" href="../../indices/a-tree/c/Cobham:Alan.html">Alan Cobham</a>: On the Hartmanis-Stearns Problem for a Class of TAG Machines. 51-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cobham68">BibTeX</a></font> <li><a name="Wagner68" href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>: ``Tapeless'' Bounded Action Machines. 61-68 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wagner68">BibTeX</a></font> <li><a name="Spira68" href="../../indices/a-tree/s/Spira:Philip_M=.html">Philip M. Spira</a>: On the Computation Time of Finite Functions. 69-75 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Spira68">BibTeX</a></font> <li><a name="Luconi68" href="../../indices/a-tree/l/Luconi:Fred_L=.html">Fred L. Luconi</a>: Output Functional Computational Structures. 76-84 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Luconi68">BibTeX</a></font> <li><a name="Ito68" href="../../indices/a-tree/i/Ito:Takayasu.html">Takayasu Ito</a>: Some Formal Properties of a Class of Non-Deterministic Program Schemata. 85-98 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ito68">BibTeX</a></font> <li><a name="Basu68" href="../../indices/a-tree/b/Basu:Sanat_K=.html">Sanat K. Basu</a>: Transformation of Program Schemes to Standard Forms. 99-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Basu68">BibTeX</a></font> <li><a name="StearnsL68" href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>, <a href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>: Property Grammars and Table Machines. 106-119 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StearnsL68">BibTeX</a></font> <li><a name="Whitney68" href="../../indices/a-tree/w/Whitney:Gordon.html">Gordon Whitney</a>: The Position of Table Languages within the Hierarchy of Nondeterministic On-Line Tape-Bounded Turing Machine Languages. 120-130 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Whitney68">BibTeX</a></font> <li><a name="Fischer68" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Grammars with Macro-Like Productions. 131-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fischer68">BibTeX</a></font> <li><a name="AhoU68" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Automaton Analogs of Syntax Directed Translation Schemata. 143-159 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoU68">BibTeX</a></font> <li><a name="Petrone68" href="../../indices/a-tree/p/Petrone:Luigi.html">Luigi Petrone</a>: Syntax Directed Mappings of Context-Free Languages. 160-175 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Petrone68">BibTeX</a></font> <li><a name="PaullU68" href="../../indices/a-tree/p/Paull:Marvin_C=.html">Marvin C. Paull</a>, <a href="../../indices/a-tree/u/Unger:Stephen_H=.html">Stephen H. Unger</a>: Structural Equivalence and LL-k Grammars. 176-186 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaullU68">BibTeX</a></font> <li><a name="Weiss68" href="../../indices/a-tree/w/Weiss:C=_Dennis.html">C. Dennis Weiss</a>: Optimal Synthesis of Arbitrary Switching Functions with Regular Arrays of 2-Input, 1-Output Switching Elements. 187-212 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Weiss68">BibTeX</a></font> <li><a name="Lechner68" href="../../indices/a-tree/l/Lechner:Robert_J=.html">Robert J. Lechner</a>: A Transform Approach to Logic Design. 213-234 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lechner68">BibTeX</a></font> <li><a name="Breuer68" href="../../indices/a-tree/b/Breuer:Melvin_A=.html">Melvin A. Breuer</a>: Fault Detection in a Linear Cascade of Identical Machines. 235-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Breuer68">BibTeX</a></font> <li><a name="Mukhopadhyay68" href="../../indices/a-tree/m/Mukhopadhyay:Amar.html">Amar Mukhopadhyay</a>: Lupanov Decoding Networks. 244-256 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mukhopadhyay68">BibTeX</a></font> <li><a name="KautzT68" href="../../indices/a-tree/k/Kautz:William_H=.html">William H. Kautz</a>, <a href="../../indices/a-tree/t/Turner:James.html">James Turner</a>: Universal Connecting Networks and the Synthesis of Canonical Sequential Circuits. 257-268 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KautzT68">BibTeX</a></font> <li><a name="Smith68" href="../../indices/a-tree/s/Smith_III:Alvy_Ray.html">Alvy Ray Smith III</a>: Simple Computation-Universal Cellular Spaces and Self-Reproduction. 269-277 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Smith68">BibTeX</a></font> <li><a name="Brzozowski68" href="../../indices/a-tree/b/Brzozowski:Janusz_A=.html">Janusz A. Brzozowski</a>: Regular-Like Expressions for Some Irregular Languages. 278-286 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Brzozowski68">BibTeX</a></font> <li><a name="Greibach68" href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Checking Automata and One-Way Stack Languages (Extended Abstract). 287-291 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Greibach68">BibTeX</a></font> <li><a name="GinsburgH68" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>: Two-Way Balloon Automata and AFL. 292-297 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GinsburgH68">BibTeX</a></font> <li><a name="Book68" href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>: Grammars with Linear Time Functions. 298-305 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Book68">BibTeX</a></font> <li><a name="GinsburgS68" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/s/Spanier:Edwin_H=.html">Edwin H. Spanier</a>: Derivation-Bounded Languages. 306-314 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GinsburgS68">BibTeX</a></font> <li><a name="Schkolnick68" href="../../indices/a-tree/s/Schkolnick:Mario.html">Mario Schkolnick</a>: Two-Type Bracketed Grammars. 315-326 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schkolnick68">BibTeX</a></font> <li><a name="HartmanisH68" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>: Structure of Undecidable Problems in Automata Theory. 327-333 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartmanisH68">BibTeX</a></font> <li><a name="Young68" href="../../indices/a-tree/y/Young:Paul_R=.html">Paul R. Young</a>: Toward a Theory of Enumerations. 334-350 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Young68">BibTeX</a></font> <li><a name="MeyerF68" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>: On Computational Speed-Up. 351-355 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MeyerF68">BibTeX</a></font> <li><a name="FischerR68" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Limited Random Access Turing Machines. 356-367 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerR68">BibTeX</a></font> <li><a name="Herman68" href="../../indices/a-tree/h/Herman:Gabor_T=.html">Gabor T. Herman</a>: The Uniform Halting Problem for Generalized One State Turing Machines. 368-372 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Herman68">BibTeX</a></font> <li><a name="FischerHB68" href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>, <a href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>: Tape Reversal Complexity Hierarchies. 373-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerHB68">BibTeX</a></font> <li><a name="Cohen68" href="../../indices/a-tree/c/Cohen:Rina_S=.html">Rina S. Cohen</a>: Transition Graphs and the Star Height Problem. 383-394 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cohen68">BibTeX</a></font> <li><a name="Muller68" href="../../indices/a-tree/m/Muller:David_E=.html">David E. Muller</a>: Use of Multiple Index Matrices in Generalized Automata Theory. 395-404 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Muller68">BibTeX</a></font> <li><a name="Yeh68" href="../../indices/a-tree/y/Yeh:Raymond_T=.html">Raymond T. Yeh</a>: Structural Equivalence of Automata. 405-412 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yeh68">BibTeX</a></font> <li><a name="UllmanW68" href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>, <a href="../../indices/a-tree/w/Weiner:Peter.html">Peter Weiner</a>: Universal Two State Machines: Characterization Theorems and Decomposition Schemes. 413-426 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/UllmanW68">BibTeX</a></font> <li><a name="Davis68" href="../../indices/a-tree/d/Davis:Wayne_A=.html">Wayne A. Davis</a>: The Linearity of Sequential Machines: A Critical Review. 427-430 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Davis68">BibTeX</a></font> <li><a name="ArnoldTN68" href="../../indices/a-tree/a/Arnold:Thomas_F=.html">Thomas F. Arnold</a>, <a href="../../indices/a-tree/t/Tan:Chung=Jen.html">Chung-Jen Tan</a>, <a href="../../indices/a-tree/n/Newborn:Monroe_M=.html">Monroe M. Newborn</a>: Iteratively Realized Sequential Circuits. 431-448 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArnoldTN68">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:12:23 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
