Jump to content

Talk:Quantum 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 99.153.64.179 (talk) at 17:59, 2 December 2013 (add maths rating). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics C‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

language

Its been a while since my CS classes but shouldn't the state machine be listed as:

(1*01*0)*

This (1*01*01*)* expanded would become 1*01*01*1*01*01*...

1*=1*1* so it seems redundent.

Mdozturk 19:23, 16 November 2006 (UTC)[reply]

No I think its correct as written. Look at the transition diagram: there are two distinct zero transitions. 99.153.64.179 (talk) 17:59, 2 December 2013 (UTC)[reply]

ouch

This makes my head hurt. Someone please write articles like these in... English, please.

OK, I just added a long "non-technical" introduction; I hope it makes things clear(er). 99.153.64.179 (talk) 17:59, 2 December 2013 (UTC)[reply]