Actions

Discussion of Finite State Machines: Difference between revisions

From Santa Fe Institute Events Wiki

No edit summary
 
No edit summary
 
(15 intermediate revisions by 9 users not shown)
Line 1: Line 1:
{{CSSS 2007 Santa Fe}}
{{CSSS 2007 Santa Fe}}


Is anyone interested in a discussion, not a tutorial, of finite state machines? I am interested in quantum versions of these and would be happy to talk about that. Would like to hear other perspectives. Leave your name after the beep - john
Is anyone interested in a discussion, not a tutorial, of finite state machines? I am interested in quantum versions of these and would be happy to talk about that. Would like to hear other perspectives. Leave your name after the beep - john  
 
*update* i am in polyahymnia 12 phone 505 995 4217


<beep>
<beep>
Know nothing about it.  Would love to learn! Vikas
Hi John -- I've done a fair bit of work on Finite State Automata (FSA) and would be really interested to hear about the quantum version of this (not least of which because my wife is working in a lab attempting to fabricate a quantum computer!).. Simon A (one of the ossies)
interested - Nate
I'd be very interested in learning about the quantum version. Risi.
Me too. Amitabh
yup. -> Josh
**I scheduled this for Thur June 7 from 7-830 in the senior seminar room.
Please tell me this is PM .. :) -- [http://www.santafe.edu/events/workshops/index.php/Amelie_Veron Amelie]
yes it's PM! -john
I have done some work on reconstruction of minimal FSM from TS. I'm interested in learning about the quantum aspect. [[Olaf Bochmann]]
* For those interested, here are a couple of papers on quantum FSM stuff
** http://www.santafe.edu/research/publications/workingpapers/06-09-031.pdf
** http://www.santafe.edu/research/publications/workingpapers/06-11-045.pdf
* For those interested in the *real* FSM, please see the following excellent reference.
** http://www.venganza.org/
-john
Follow up: strictly sofic processes (e.g. even process) can not be represented as finite state Markov-models, but as FSM.
* Benjamin Weiss. Subshifts of finite type and sofic systems. Monatshefte für Mathematik, 77:462–474,
1973.
* C. R. Shalizi, K. L. Shalizi, and J. P. Crutchfield. An algorithm for pattern discovery in time series. arXiv:cs/0210025v3, 2002.
[[Olaf Bochmann]]

Latest revision as of 05:19, 8 June 2007

CSSS Santa Fe 2007

Is anyone interested in a discussion, not a tutorial, of finite state machines? I am interested in quantum versions of these and would be happy to talk about that. Would like to hear other perspectives. Leave your name after the beep - john

  • update* i am in polyahymnia 12 phone 505 995 4217

<beep>

Know nothing about it. Would love to learn! Vikas

Hi John -- I've done a fair bit of work on Finite State Automata (FSA) and would be really interested to hear about the quantum version of this (not least of which because my wife is working in a lab attempting to fabricate a quantum computer!).. Simon A (one of the ossies)

interested - Nate

I'd be very interested in learning about the quantum version. Risi.

Me too. Amitabh

yup. -> Josh

    • I scheduled this for Thur June 7 from 7-830 in the senior seminar room.

Please tell me this is PM .. :) -- Amelie

yes it's PM! -john

I have done some work on reconstruction of minimal FSM from TS. I'm interested in learning about the quantum aspect. Olaf Bochmann


-john


Follow up: strictly sofic processes (e.g. even process) can not be represented as finite state Markov-models, but as FSM.

  • Benjamin Weiss. Subshifts of finite type and sofic systems. Monatshefte für Mathematik, 77:462–474,

1973.

  • C. R. Shalizi, K. L. Shalizi, and J. P. Crutchfield. An algorithm for pattern discovery in time series. arXiv:cs/0210025v3, 2002.

Olaf Bochmann