Does a Rock Implement Every Finite-State Automaton? David J
[link][more
Finite State Automaton FSA in Prolog--By kschweitz on Oct 17
The objective is to develop a Prolog program that simulates a non-deterministic finite state automaton (FSA). Full requirements will be sent as a text file during bid negotiation. Note that this is a (more) Keywords:Other
Music Information Retrieval from a Singing Voice Using Lyrics and
A finite state automaton (FSA) is used as recognition grammar, and about 86% retrieval accuracy was obtained. We also develop an algorithm for verifying a hypothesis output by a lyrics recognizer. Melody information is extracted from an
In Praise of Automata
I have a confession to make: I am inordinately fond of automata theory. What is the least we can do to augment a finite automaton, while preserving its -Muller: an automaton with state-space Q accepts if the set S of infinitely
Re: Adaptive/Intelligent Tutoring by Moodle
When we examined IMS Learning Design a while back, someone (okay, it was me ) raised the issue that LD can be completely modeled by a finite state automaton. My hunch is that any truly universal instructional design system is going to
Why Machines Will Never be Conscious
We are much closer to infinity than any finite state automaton can ever be. We are simply not computers, although we can sometimes think like them they cannot really think like us. In any case, this may be "faith" but for now at least I
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for these automata are well studied and have been implemented
DrProject Internals: Parting Notes on the Wiki
More specifically, Plex was spending 1.9 seconds lating a nondeterministic finite state automaton (NFA) into its deterministic equivalent (a DFA) each time DrProject rendered a wiki page. This isn’ta bug in Plex,
Wake me when the Matrix answers
They asserted that a finite-state machine known as a cellular automaton could reproduce any physical or mental process, and in the 1960s Konrad Zuse, who built the first program-controlled computer in 1941, asserted that the universe is
Regular Expression Finite State Automaton
An interactive visualization of how finite-state automata are used to match regular expressions. Visualizing theory, anyone
finite+state+automation: finite+state+automation