Re: Mathematical definition of automata?

On Jun 8, 1:45 pm, markw...@xxxxxxxxx wrote:
The Untold Story of Formal Languages
Part 3: The Algebraic Representation of Automatahttp://federation.g3z.com/CompSci/index.htm#Untold3

Thank you for the reference. Here is another perspective I came
across:
http://www.cs.cornell.edu/Courses/cs786/2004sp/
Lecture 8:
Algebraic Definition of Finite Automata
Def 8.1 A finite automaton over K is a triple A_ = (u,A,v) where u and
v are vectors and A is matrix....
The language accepted by A_ is the element u^T A* v

So, we still have start and stop states, but at least they are
introduced naturally.

.