algorithm - Using finite automata as keys to a container -

-

I have a problem where I should be able to use finite automata as the granular container for each key actually auto Should be represented by the equivalence class, so when I search, I will get an equal otmoson (if such a key is present), even if the swap is not structurally identical.

An obvious final Sahara approach is definitely to use linear search with a equivalence test for checking each key. I hope that it is possible to do better than this.

I am trying to implement an arbitrary, but consistent order, and am trying to get a serial comparison algorithm. The first principles include sets of strings that represent automata. Evaluate the set of possible first tokens for each automaton, and apply an order based on those two sets. If necessary, continue to the next set of tokens, third tokens etc. The obvious problem of doing it naively is that there is an infinite number of tokens-set to check before equivalence is proven.

There are some ambiguous ideas to consider - first to reduce input automation and to use some sort of closed algorithm, or to convert it into regular grammar, incorporating some ideas from the spreading trees. I have come to the conclusion that I need to leave set-to-token lexical ordering, but the most important conclusion I have taken so far is that it is not trivial, and I'm probably better off reading any one Elses solution

I have downloaded a paper from CiteSeerX - but my abstract algebra is not good enough to know that it is still relevant.

It also happened to me that there can be a way to get a Hesh from Swaponan, but I have not given much thought to it yet.

Can someone read a good paper? - Or at least tell me what I've downloaded is a red herring or not?

I believe that you can at least get an authentic form from automata. For any two equal automatons, their least sized size isomorphic (I believe this is from the Mihill-Nerod theorem). It respects the isomorphism edge labels and course node classes (starting, accepting, accepting non-acceptance), this makes it easier than unexpected graphs isomorphism.

I think that if you build a spanning tree of at least automaton started from the initial state and order the output edges by your label, you will receive an authentic form For automation which can be washed later

Edit: The edges of non-tree should also be taken into account, but they can also be ordered by their label.


Comments

Post a Comment

Popular posts from this blog

c# - How to capture HTTP packet with SharpPcap -

-
I would like to capture all incoming HTTP packets on my machine. To do this, I am using SharpPcap which is a WinPcap The cover is. SharpPcap works very well, but it captures TCP packets and what it wants to do for me is a very low level. Does anyone know how can I easily get full HTTP requests / reactions from all these TCP packets? Thanks SharpPcap is already able to capture the packet in the same way That's what the virus does (just in the code instead of the GUI). And you can either either parse them directly or you can put them in the drive in the common .pcap file format. The steps to parse the capture are: Open a connection at any time Loop a while Or start capturing using an event callback Parsing the raw packet for the type you want If you are reading .PPP dump files In addition to calling you an offline capture reader is almost the same, there is no need to select an interface, and you can set the majority There is no need to do the modes. All st
Read more

jquery - SimpleModal Confirm fails to submit form -

-
I am trying to confirm jQuery to show yes / no confirmation when I submit a form. I had modified (in the last list) to capture and block form submissions. However, it only works with jQuery 1.2.6, a recent upgrade stops 1.3.2, if yes is clicked, then by submitting the form. But I can not understand what is wrong / inconsistent in my code now. Demo (which works in both versions of a simple window.href implementation). $ (document) .ready (function () {$ ('input.delete'). Click (function (e) {e.preventDefault (); var target = $ (e .target); Confirm ("Really delete this event?", Function () {target.click ()});});}); How about something like this? The idea of ​​catching clicks (and fire!) On the submitted event is not click event. $ (document) .ready (function () {$ ('# myForm'). Submit (function () {var f = this; Confirm (" Remove? ", Function () {$ (f). Submit ();}) Return; Return the initial session;}}}}; Hope That this is som
Read more

php - Multiple Select with Explode: only returns the word "Array" -

-
By using Wordpress I have created a multiple selection box so that users can select categories to exclude. When the page is initially loaded, I see my predefined default option. However, when I select a new value and I save ... I only see the word "Array" and have not chosen anything else? & lt; Class = "amultiple" id = "& lt; php echo $ value ['id'] ;? gt;" name = "& gt; php echo $ value ['id'] ;; gt; []" Multiple = "multiple" size = "8" & gt; & Lt ;? Php global option; Foreign currency ($ value as value $) {if (get_settings ($ value ['id']) === FALSE {$$ value ['id'] = $ value ['std']; } And {$$ value ['id'] = get_settings ($ value ['id']); }} $ Ranges = & amp; Amp; Categories ('type = post & orderbiz = name & amp; hide_empty = 1'); If ($ ranges) {$ ex_cat = implode (',', $ tt_cat_exclude); Forex Currency ($ range a
Read more