Talk:Deterministic finite state machine

From Wikipedia, the free encyclopedia

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)

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

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)

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)

[edit] symbols

The symbols used to describe the 5-turple are inconsistent with those in Automata theory. Is it better to change to \langle Q, \Sigma, \delta, S_0, F\rangle? My textbook also uses these notations.

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

[edit] Merge proposal

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

[edit] Regular languages in relation to FSM

Can someone please explain the following entry in the article more. Now sure what this exactly is in relation to FSM (the article on regular language is just as perplexing).

The language of M can be described by the regular language given by this regular expression:

   1*(01*01*)*

yusufm 20:51, 13 April 2006 (UTC)

The section on regular language is the best place to parse this. The * is the Kleene Star mentioned in that article. So 1* is the set { epsilon, 1, 11, 111, 1111...) The Kleene star operator over a number of the alphabet symbols such as (01)* is the set { epsilon, 01, 0101, 010101...) Essentially it means none, one, or more of the items repeating.

Retrieved from "http://en.wikipedia.org../../../d/e/t/Talk%7EDeterministic_finite_state_machine_850d.html"