lua-users home
lua-l archive

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]



On Thu, Mar 28, 2019 at 10:13 AM Viacheslav Usov <via.usov@gmail.com> wrote:
On Thu, Mar 28, 2019 at 2:30 PM Coda Highland <chighland@gmail.com> wrote:

> FSMs can't handle parentheses.

This is not true unless you qualify this further. (Hint: any general-purpose computer is an FSM)

Cheers,
V.

No, general-purpose computers are Finite Turing Machines, not Finite State Machines. These two formalisms are TWO tiers of computing power apart, with Push-Down Automata existing in between.

/s/ Adam