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 Teetooan (talk | contribs) at 20:19, 26 February 2014. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]