On Monday, August 4, 2003, at 10:11 pm, Julia Thompson wrote:
Deborah Harrell wrote:
--- William T Goodall <[EMAIL PROTECTED]> wrote:Deborah Harrell wrote:
<snipped paragraph of lingua-babble>automata<head jerks up from obfuscationist-babble-induced near-coma>
That's not obfuscationist babble, that's jargon!
The Chomsky Hierarchy
Regular languages <-> Finite automata Context-free languages <-> Pushdown automata Context-sensitive languages <-> Linear boundedRecursively enumerable languages <-> Turing machines
<scratches head> And if I understood your response, would I understand the jargon? ;)
Possibly. It made *some* sense to me, anyway.
However, I'm not sure on the "pushdown automata" and the "linear bounded
automata" myself. Anyone care to explain? :)
A pushdown automaton has an auxiliary stack, a linear bounded automaton is a Turing machine where the tape size is a constant multiple of the input size.
-- William T Goodall Mail : [EMAIL PROTECTED] Web : http://www.wtgab.demon.co.uk Blog : http://radio.weblogs.com/0111221/
'The true sausage buff will sooner or later want his own meat grinder.' -- Jack Schmidling
_______________________________________________ http://www.mccmedia.com/mailman/listinfo/brin-l
