focs69.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>10. FOCS 1969: Waterloo, California</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>10. <a href="index.html">FOCS</a> 1969: Waterloo, California</h1> 10th Annual Symposium on Foundations of Computer Science, Waterloo, California, October 1969. IEEE Computer Society <ul> <li><a name="BorodinCH69" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>, <a href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>: Dense and Non-Dense Families of Complexity Classes. 7-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BorodinCH69">BibTeX</a></font> <li><a name="Constable69" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: The Operator Gap. 20-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Constable69">BibTeX</a></font> <li><a name="Tsichritzis69" href="../../indices/a-tree/t/Tsichritzis:Dennis.html">Dennis Tsichritzis</a>: Iterative Procedures. 27-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Tsichritzis69">BibTeX</a></font> <li><a name="HopcroftK69" href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/k/Kerr:L=_R=.html">L. R. Kerr</a>: Some Techniques for Proving Certain Simple Programs Optimal. 36-45 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HopcroftK69">BibTeX</a></font> <li><a name="Logrippo69" href="../../indices/a-tree/l/Logrippo:Luigi.html">Luigi Logrippo</a>: Storage Interference in Asynchronous Computations. 46-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Logrippo69">BibTeX</a></font> <li><a name="BrunoA69" href="../../indices/a-tree/b/Bruno:John_L=.html">John L. Bruno</a>, <a href="../../indices/a-tree/a/Altman:S=_M=.html">S. M. Altman</a>: Asynchronous Control Networks. 61-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrunoA69">BibTeX</a></font> <li><a name="Booth69" href="../../indices/a-tree/b/Booth:Taylor_L=.html">Taylor L. Booth</a>: Probabilistic Representation of Formal Languages. 74-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Booth69">BibTeX</a></font> <li><a name="Lovell69" href="../../indices/a-tree/l/Lovell:Bernard_W=.html">Bernard W. Lovell</a>: The Incompletely-Specified Finite-State Stochastic Sequential Machine Equivalence and Reduction. 82-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lovell69">BibTeX</a></font> <li><a name="Gelenbe69" href="../../indices/a-tree/g/Gelenbe:Erol.html">Erol Gelenbe</a>: On Probabilistic Automata with Structural Restrictions. 90-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gelenbe69">BibTeX</a></font> <li><a name="KfouryL69" href="../../indices/a-tree/k/Kfoury:Denis_J=.html">Denis J. Kfoury</a>, <a href="../../indices/a-tree/l/Liu:Chung_L=.html">Chung L. Liu</a>: Definite Stochastic Sequential Machines and Definite Stochastic Matrices. 100-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KfouryL69">BibTeX</a></font> <li><a name="GrayH69" href="../../indices/a-tree/g/Gray:Jim.html">Jim Gray</a>, <a href="../../indices/a-tree/h/Harrison:Michael_A=.html">Michael A. Harrison</a>: Single Pass Precedence Analysis (Extended Abstract). 106-117 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrayH69">BibTeX</a></font> <li><a name="StearnsR69" href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>: Table Machine Simulation. 118-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StearnsR69">BibTeX</a></font> <li><a name="Kosaraju69" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: Recognition of Context-Free and Stack Languages. 129-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kosaraju69">BibTeX</a></font> <li><a name="Walters69" href="../../indices/a-tree/w/Walters:Daniel_A=.html">Daniel A. Walters</a>: Deterministic Context-Sensitive Languages. 133-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Walters69">BibTeX</a></font> <li><a name="Fischer69" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Two Characterizations of the Context-Sensitive Languages. 149-156 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fischer69">BibTeX</a></font> <li><a name="FischerR69" href="../../indices/a-tree/f/Fischer:Gerald_A=.html">Gerald A. Fischer</a>, <a href="../../indices/a-tree/r/Raney:George_N=.html">George N. Raney</a>: On the Representation of Formal Languages Using Automata on Networks. 157-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerR69">BibTeX</a></font> <li><a name="Kohavi69" href="../../indices/a-tree/k/Kohavi:Igal.html">Igal Kohavi</a>: Fault Diagnosis of Logical Circuits. 166-173 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kohavi69">BibTeX</a></font> <li><a name="Kriz69" href="../../indices/a-tree/k/Kriz:Thomas_A=.html">Thomas A. Kriz</a>: Machine Identification Concepts of Path Sensitizing Fault Diagnosis. 174-181 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kriz69">BibTeX</a></font> <li><a name="ShaS69" href="../../indices/a-tree/s/Sha:Richard_T=.html">Richard T. Sha</a>, <a href="../../indices/a-tree/s/Sze:T=_W=.html">T. W. Sze</a>: Threshold Logic: A Simplified Synthesis by a Recursive Method. 182-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShaS69">BibTeX</a></font> <li><a name="ArnoldN69" href="../../indices/a-tree/a/Arnold:Thomas_F=.html">Thomas F. Arnold</a>, <a href="../../indices/a-tree/n/Newborn:Monroe_M=.html">Monroe M. Newborn</a>: Iteratively Realized Sequential Circuits: Further Considerations. 194-212 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArnoldN69">BibTeX</a></font> <li><a name="KingW69" href="../../indices/a-tree/k/King_III:W=_Frank.html">W. Frank King III</a>, <a href="../../indices/a-tree/w/Weiner:Peter.html">Peter Weiner</a>: On the Modular Decomposition of Autonomous Sequential Machines. 213-221 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KingW69">BibTeX</a></font> <li><a name="Greibach69" href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Full AFLs and Nested Iterated Substitution. 222-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Greibach69">BibTeX</a></font> <li><a name="AhoU69" 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>: A Characterization of Two-Way Deterministic Classes of Languages. 231-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoU69">BibTeX</a></font> <li><a name="Brainerd69" href="../../indices/a-tree/b/Brainerd:Walter_S=.html">Walter S. Brainerd</a>: Semi-Thue Systems and Representations of Trees. 240-244 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Brainerd69">BibTeX</a></font> <li><a name="JoshiKY69" href="../../indices/a-tree/j/Joshi:Aravind_K=.html">Aravind K. Joshi</a>, <a href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>, <a href="../../indices/a-tree/y/Yamada:H=.html">H. Yamada</a>: String Adjunct Grammars. 245-262 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JoshiKY69">BibTeX</a></font> <li><a name="NashC69" href="../../indices/a-tree/n/Nash:B=_O=.html">B. O. Nash</a>, <a href="../../indices/a-tree/c/Cohen:Rina_S=.html">Rina S. Cohen</a>: Parallel Leveled Grammars. 263-276 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NashC69">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
