No, not especially familiar, but it sounds interesting. Personally I am interested in learning formal grammars to describe data, and there are well-established equivalences between grammars and automata, so the approaches are somewhat compatible. According to wikipedia, semiautomata have no output, so you cannot be using them as a generative model, but they also lack accept-states, so you can't be using them as recognition models, either. How are you using them?
-Abram On Thu, Jul 17, 2008 at 1:05 PM, John G. Rose <[EMAIL PROTECTED]> wrote: >> From: Abram Demski [mailto:[EMAIL PROTECTED] >> John, >> What kind of automata? Finite-state automata? Pushdown? Turing >> machines? Does CA mean cellular automata? >> --Abram >> > > Hi Abram, > > FSM, semiatomata, groups w/o actions, semigroups with action in the > observer, etc... CA is for cellular automata. > > This is mostly for spatio temporal recognition and processing I haven't > tried looking much at other data yet. > > Why do you ask are you familiar with this? > > John > > > > > ------------------------------------------- > agi > Archives: https://www.listbox.com/member/archive/303/=now > RSS Feed: https://www.listbox.com/member/archive/rss/303/ > Modify Your Subscription: https://www.listbox.com/member/?&; > Powered by Listbox: http://www.listbox.com > ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=108809214-a0d121 Powered by Listbox: http://www.listbox.com
