Re: Regualar Expression Theory

Stephen Harris wrote:

>
> "Etienne Marais" <etienne@xxxxxxxxxxxxxxxx;etienne.marais@xxxxxxxxx> wrote
> in message news:dpk444$gpv$1@xxxxxxxxxxxxxxxxxxxxx
>> Hi
>>
>> Could somebody please refer me to
>> the 'academics' behind regular
>> expressions ? Different shells
>> and utilities have different
>> interpretations. I would like to
>> know more about where RE's come
>> from and how they developed...
>>
>> --
>> Etienne Marais
>> Cosmic Link
>> South Africa
>>
>
> Papadimitriou and Sispser have written Introductions to the theory of
> computation.
> Papadimitriou taught a class in foundational papers which contributed to
> computation.
> The most interesting paper to me was: "Simulating physics with computers"
> http://www.cs.berkeley.edu/%7Erfonseca/courses/classics/feynman.pdf
>
> http://www.cs.berkeley.edu/~christos/classics/cs298.html
> Euler's paper on the Konigsberg bridges; do you know of a translation?
> (or Latin?)
>
> On computable numbers, with an application to the Entscheidungsproblem.
> Alan Turing 1936
> As We May Think. Vannevar Bush, 1945
>
> First Draft of the Report on EDVAC. John von Neumann 1946
>
> A Mathematical Theory of Communication. Claude E. Shannon 1948
> The Turing Test paper, Alan Turing 1950
>
> Non-Cooperative Games. John Nash, 1951
> and a few more
>
> Textbook:
> H.R. Lewis, C.H. Papadimitriou:
> Element of the Theory of Computation, Prentice Hall, 2nd Edition, 1998.
>
> Reference Books:
> C. Calude:
> Theories of Computational Complexity, North Holland, 1988.
> M. Chandrasekaran, and K.L.P. Mishra:
> Theory of Computer Science: Automata, Language and Computation, Prentice
> Hall, 1995.
> ***J.E. Hopcroft, J.D. Ullman:
> Introduction to Automata Theory, Languages, and Computation,
> Addison-Wesley, Massachusetts, 1979.
> ***M. Sipser:
> Introduction to the Theory of Computation, Pws Pub Co, USA, 1996.
> C.H. Smith:
> A Recursive Introduction to the Theory of Computation, Springer Verlag,
> 1994.
> R.G. Taylor:
> Model of Computation and Formal Languages, Oxford University Press,
> 1997. M.R. Garey and D. S. Johnson:
> Computer and Intractability, W.H. Freeman and Company, New York, 1979.

Are these references related to regular expressions ?

--
Etienne Marais
Cosmic Link
South Africa

.

Relevant Pages

  • Re: Past Tenses in Western Europe
    ... I have noticed that IE languages generally ... Over time, emphatic expressions gradually crowd ... _interpreted_ as marking an aspectual distinction in English. ...
    (sci.lang)
  • Re: function : question on argument for output
    ... languages in productive use around that have this feature; ... permits functions to be written with side-effects. ... for an agressively optimizing compiler in expressions. ...
    (comp.lang.fortran)
  • Re: Regular expressions for replacements in Excel?
    ... The Word wildcards seem to be much more limited than real regular ... expressions, so I had already eliminated that option. ... or not it ended in the slash that I intended to require. ... since I think that one of the later transformations is ...
    (microsoft.public.word.vba.general)
  • Re: Regular expressions for replacements in Excel?
    ... The Word wildcards seem to be much more limited than real regular ... expressions, so I had already eliminated that option. ... or not it ended in the slash that I intended to require. ... since I think that one of the later transformations is ...
    (microsoft.public.excel.programming)
  • Re: Regular expressions for replacements in Excel?
    ... The Word wildcards seem to be much more limited than real regular ... expressions, so I had already eliminated that option. ... or not it ended in the slash that I intended to require. ... since I think that one of the later transformations is ...
    (microsoft.public.word.vba.beginners)