long time no see..yeah you’re right. I spent last summer writing lot of stuff, I contributed to get Axiom ported on Windows Phone 7, and many other things….in short, as you can imagine, I prefer using laguages like c/c++, c# and others…but not spoken languages

After this introduction (with tongue in my cheek), let start talking about the sample I wrote and I’m sharing today with you…

The sample, written in C#, shows how it is possible to use finite state automatons to accomplish indexing tasks. We start constructing an NFA from a string over an alphabet of 0 and 1 (in the sample source code is “0100101″). This NFA has a particular feature: all its states are both initial and accepted. So the representation of the non-deterministic automaton will be as follows:

The next step will be creating a DFA starting from the previous created NFA, using the subset construction algorithm. This automaton will have all states accepted as well as NFA, but there will be only one initial state (definition of deterministic automaton).

This DFA will be finally used for searching substring occurrences in the string “0100101″, already indexed.

Download the source code Indexing with Automatons sample

• Previous solution limit has been removed from the trial version, so you can now use the application without any time or solution limit…By downloading the trial version, you’ll get an application that is now free to use! Obviously, if you want to get rid of the advertisements, please consider to buy the full version, in order to support future releases;
• The K-Map algorithm has been optimized, and in the twinkling of an eye, you’ll get the solution, even with 7 variables and with complicated inputs;
• Increased the number of variables you can use up to 7, and they’re available both in trial and full version;
• The truth table style has been modified to get minterms more readable;
• Added a reset button that become really useful when you need to reset the truth table to its initial state and you’re using 5 or more variables;

Let me take this opportunity to let you know that K-Map related news are coming soon, so stay tuned!

K-Map Solver is an application able to minimize, using Karnaugh maps, boolean functions, starting from its main component, the truth table.

It’s useful to who needs, for instance, of a minimized boolean function to create a combinatorial circuit with minimum complexity, or to who needs to “connect” n boolean variables (up to 4 in the 1.0 version, 7 in the next release) and feel always certain to obtain the wanted result.

You can download the complete application clicking on the following link. It’s also available a limited trial version.