2
votes
Vote UpVote

Finite Automata with Thundax P-Zaggy

Random thoughts on coding – I have moved forward the development of Thundax P-Zaggy with the addition of a Finite Automata builder and simulator. "A deterministic finite automaton (DFA) also known as deterministic finite state machine is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation (or run) of the automaton for each input string. (wikipedia)". Building the automata with P-Zaggy is quite simple, so let's start by building a DFA for the following language: L = {ba | abna, n > 0}.As it is shown in the previous image, the DFA would be as ...
Favorite? Off-Topic? Jordi Corbilla @ 2011-12-29 14:03

Statistics

Visits: 637
Votes: 2
Favorites: 0
Off-Topic: 0

Visits by Source

User Actions

Users who voted for this posting

Jeroen Pluimers
Jordi Coll Corbilla
Subscribe:
Contact us to advertise on DelphiFeeds.com

Community Links

Torry Firebird News

Sponsor

 
Please login or register to use this functionality.
(click on this box to dismiss)