[Home] [By Thread] [By Date] [Recent Entries]
--- Michael Kay <mike@s...> wrote: > The standard algorithms for generating a > finite-state machine from a grammar > suffer from the problem that the number of possible > states becomes very > large I have heard that XSLT 1.0 is Turing complete .. Is XSLT 2.0 also? If yes, what will be the proof of this fact? Regards, Mukul __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com
|

Cart



