Jump to content

Talk:Deterministic finite automaton

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ancheta Wis (talk | contribs) at 02:25, 3 December 2005 (Merge - oppose). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

To what field of human endeavor does this relate? Could someone put an introductory sentance in English for the rest of us? Thanks! ;) Mark Richards 06:21, 14 May 2004 (UTC)[reply]

Doesn't everyone know automata theory?  :-) -- jaredwf 07:27, 14 May 2004 (UTC)[reply]

Thanks Jaredwf! Just a stupid question though - Finite State Machine says that it is related to 'computer science', while DFST points to 'Theory of computing'. Is this as it should be? Thanks! Mark Richards 15:39, 14 May 2004 (UTC)[reply]

I changed the finite state machine to say theory of computation, since theory of computation is a more exact answer. Thanks for noticing. -- jaredwf 15:46, 14 May 2004 (UTC)[reply]

symbols

The symbols used to describe the 5-turple are inconsistent with those in Automata theory. Is it better to change to ? My textbook also uses these notations.

I'm in favor of this change. Pkirlin 06:47, 11 November 2005 (UTC)[reply]

Merge proposal

Oppose. Other articles reference FSMs without the presumption of determinism. --Ancheta Wis 02:25, 3 December 2005 (UTC)[reply]