Finite Automata in FASM

Index > DOS > Finite Automata in FASM

Goto page Previous 1, 2, 3, 4 Next

Author

Thread

vid
Verbosity in development

Joined: 05 Sep 2003
Posts: 7105
Location: Slovakia

vid 04 Sep 2006, 14:19

wow

http://en.wikipedia.org/wiki/NETtalk_(artificial_neural_network)

04 Sep 2006, 14:19

shoorick

Joined: 25 Feb 2005
Posts: 1613
Location: Ukraine

shoorick 04 Sep 2006, 14:55

how far is this research. do they understand how these 300-neuron "persnalities" work i can not say. i read these books long ago (10-20 years ago), forgot a lot and had no checking news, so, can be not actual - just remember some Smile

04 Sep 2006, 14:55

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 04 Sep 2006, 18:12

shoorick:
No matter how long time ago You learnt about neural networks. The basement of knowledge is invariable and You (as a biologist and programmer in one Wink

) may say us many interesting and important things about NN. Smile

Regards,
M.H.

04 Sep 2006, 18:12

Mac2004

Joined: 15 Dec 2003
Posts: 314

Mac2004 05 Sep 2006, 04:13

Just little bit of the topic....

I noticed that it's easy to see whether a number is divisible 2 when you test bit 0 of the number. If bit 0 is 0 the number is divisible by 2 and vice versa.

'Tested' with my scientific calculator. Wink

Correct me if I am wrong....

regards mac2004

05 Sep 2006, 04:13

Madis731

Joined: 25 Sep 2003
Posts: 2139
Location: Estonia

Madis731 05 Sep 2006, 05:27

Please check a few posts (pages) back - and for every assembly guy this thing is obvious Wink

why is there SHL/SHR !?

05 Sep 2006, 05:27

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 08 Sep 2006, 13:51

Today (08.09.2006.) this thread (and other on "Important/Interesting threads" list) has been moved from FASM GEMS to WICKED FASM MACRO HUMOR: , i.e.
from "See here, it's valuable" to "Don't take this serious, Pal! ".

I only hope, that "wicked" mean "playful" here (but not "immoral" or "spiteful" - other meanings of this word).

Many thanks,
M.H.

08 Sep 2006, 13:51

vid
Verbosity in development

Joined: 05 Sep 2003
Posts: 7105
Location: Slovakia

vid 08 Sep 2006, 14:00

no, FASM GEMS was renamed to WICKED FASM MACRO HUMOR. This name is a thing i was mentioning earlier, kinda tradition

anyway, true meaning of that part is somewhere in the middle, some things go more to wicked, some to gems, don't take it personally.

I find this name funnier than "Interesting macros", but of course, you can propose better one. If you want i can move you to "macro solutions".

and don't take it too seriously Wink

08 Sep 2006, 14:00

shoorick

Joined: 25 Feb 2005
Posts: 1613
Location: Ukraine

shoorick 08 Sep 2006, 14:05

new sweep sweeps clean Very Happy

--
(rus. proverb)

08 Sep 2006, 14:05

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 11 Sep 2006, 14:06

vid:

OK. It's all right now. Very Happy

"MACRO SOLUTIONS" is a good category.

Thanks,
M.H.

11 Sep 2006, 14:06

shoorick

Joined: 25 Feb 2005
Posts: 1613
Location: Ukraine

shoorick 21 Sep 2006, 10:15

here is low-commented example of automata, decoding constants, written in floating point format. based on automata i've been learning some time ago.

ps: sorry for win format in dos section Smile

Description:		Download
Filename:	automat.0.2.1.1.zip
Filesize:	6.15 KB
Downloaded:	365 Time(s)

_________________
UNICODE forever!

21 Sep 2006, 10:15

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 22 Sep 2006, 09:53

Thank You Shoorick for Your example! Very Happy

I'll write some comments for it later (now I'm going to shorten branches and twiggies of my pine trees). Wink

Previously presented examples of Finite Automata are very close to lexical/syntactical analysers, and You know it very well... Every usable program has own input and to work properly needs data checking. Very Happy

Regards,
M.H.

22 Sep 2006, 09:53

Borsuc

Joined: 29 Dec 2005
Posts: 2465
Location: Bucharest, Romania

Borsuc 22 Sep 2006, 15:34

MHajduk: Hi, I understood very well what finite state machines are, thanks. But what I didn't understand was how these can accomplish the "check if it is divisable". I mean, I don't know why after a 1 comes a 0, and then it's divisable by 6 (it was only an example, not even true).. I don't understand this "relation", FSMs are cool. If you can post some links it would help alot.

sorry for being confused. thanks Smile

22 Sep 2006, 15:34

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 22 Sep 2006, 16:34

The_Grey_Beast:

The_Grey_Beast wrote:

I mean, I don't know why after a 1 comes a 0, and then it's divisable by 6

General description of the construction such kind of automata was schematically described above. Very Happy

The_Grey_Beast wrote:

it was only an example, not even true

Which automaton was faulty in Your opinion and why?

The_Grey_Beast wrote:

If you can post some links it would help alot.

All my knowledge about finite automata is based on my "reminiscences" from my university study, not from the internet. Very Happy

Regards,
M.H.

22 Sep 2006, 16:34

Borsuc

Joined: 29 Dec 2005
Posts: 2465
Location: Bucharest, Romania

Borsuc 22 Sep 2006, 17:07

MHajduk wrote:

Which automaton was faulty in Your opinion and why?

Sorry, I meant "my" example was not true (the one about 1 coming after 0).. all automatas presented are cool and OK (and work of course). My example was not true (it wasn't even an automata).

The thing I don't get is not automata, but the "algorithm" of the "divisable by xxx". I mean, I know automata is able to do so, but based on what algorithm? I understood FSM perfectly (thanks) but the algo is the one blurring me... hope it makes sense this time

22 Sep 2006, 17:07

donkey7

Joined: 31 Jan 2005
Posts: 127
Location: Poland, Malopolska

donkey7 22 Sep 2006, 17:49

the.grey.beast:
i hope my explanation i written previously in this topic: http://board.flatassembler.net/topic.php?p=43025#43025 is usable.

the algorithm is:

Code:

a = 0
while not eof
  readdigit i
  a = ((a * k) + i) mod n
  if a = 0 then
    print 'number is divisible by n!'

n is the divisor
k is a number base of input number
i is the incoming digit (automatas goes from one digit to next, accessing one digit only once)
a is the current state - in this case it's simply the rest of dividing current number by n (modulo n) - if the rest is zero then number is divisible

22 Sep 2006, 17:49

Borsuc

Joined: 29 Dec 2005
Posts: 2465
Location: Bucharest, Romania

Borsuc 22 Sep 2006, 19:14

sorry, I didn't see your post before. thanks

22 Sep 2006, 19:14

LocoDelAssembly
Your code has a bug

Joined: 06 May 2005
Posts: 4624
Location: Argentina

LocoDelAssembly 18 Oct 2010, 21:49

MHajduk, just small reminder, you did not point the images to the new server Razz

18 Oct 2010, 21:49

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 18 Oct 2010, 21:58

Yeah, unfortunately, I haven't saved copies of these images, so they seem to be lost forever... unless I simply draw their new versions and upload to the current server. Wink

18 Oct 2010, 21:58

3200th

Joined: 23 Nov 2008
Posts: 84
Location: perfect match

3200th 19 Oct 2010, 03:12

MHajduk wrote:

Yeah, unfortunately, I haven't saved copies of these images, so they seem to be lost forever...

Don't worry. Information cannot be destroyed. The images in question still exist ... in your beautiful mind!

Wink

19 Oct 2010, 03:12

MHajduk

Joined: 30 Mar 2006
Posts: 6108
Location: Poland

MHajduk 19 Oct 2010, 09:23

Thank you, 3200th, for your faith in my data recovery abilities. Wink

19 Oct 2010, 09:23

Goto page Previous 1, 2, 3, 4 Next

< Last Thread | Next Thread >

Forum Rules:

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum