[CSUSB]>> [CNS]>> [Comp Sci Dept]>> [R J Botting]>> biba.php

Bibliographic Item (1.0)

Hopkins94

  1. Mark Hopkins<mark@omnifest.uwm.edu>
  2. "Re: 'Program Verification: The Very Idea' ..."
  3. E Mail Aug 23..Aug 31 1994
  4. =THEORY GRAMMAR CODE TECHNICAL STRUCTURE DIGRAPH NONSEQUENTIAL CFL
      Infinite graphs

      equation (in strange monoids), generating non CF languages

    1. CCFL::=concurrent context free language.

      Finite intersections.

      "chipping away at the language block without driving a stake through its center is a characteristic of "[the 1970's]

      Automata - infinite state have a revealing structure: N dimensional!

      Context Free Expressions for nonCFLs!

      Interleaving is like processing concurrently.

      Liu and Wiener

Search for bibliographic items containing a matching string.


(Search uses POSIX regular expressions and ignores case)

Search for a specific bibliographic item by name.



To see the complete bibliography (1Mb+) select:[Bibliography]