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 RicardAnufriev (talk | contribs) at 03:10, 16 December 2014 (What is the point or this? Examples?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconPhysics C‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Physics, a collaborative effort to improve the coverage of Physics 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-importance on the project's importance scale.

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]

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

what is the meaning of accepted

I may not read it well. How do you define the fact that a string is accepted? Is it a yes-no accept? I did not even identify where you discuss it. So I even less understand what is a language recognized by such an automaton.Teetooan (talk) 20:19, 26 February 2014 (UTC)[reply]

What is the point or this? Examples?

The article only states what QFAs are and how they are constructed. It lacks the why.

Some use cases would be cool or the description of problems, which can be solved by those. --RicardAnufriev (talk) 03:10, 16 December 2014 (UTC)[reply]