Classes of Automata

Here is one way to carve up abstract (mathematical) automata into different classes of complexity (from low to high).

There is a somewhat different and older one that is based on the Chomsky Hierarchy (where ND stands for non-deterministic), and the associated language or grammar that they recognize:

Further Reading:

https://en.wikipedia.org/wiki/Automata_theory

https://en.wikipedia.org/wiki/Chomsky_hierarchy

[*11.138]

<>

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.