finite-automata

I have a problem which has an solution that can be solved by iteration, but I'm wondering if there's a more elegant solution using regular expressions and split() I have a string (which excel is putting on the clipboard), which is, in essence, comma delimited. The caveat is that when the cell values contain a comma, the whole cell is surrounded with quotation marks (presumably to escape the commas within that string). An example string is as follows: 123,12,"12,345",834,54,"1,111","98,273","1,923,002",23,"1,243" Now, I want to elegantly split this string into individual cells, but the catch is

I have been working on a project for a month or so now to develop a XML validator (XSD) in javascript. I have gotten really close but keep running into problems. The only thing I have working well is normalizing schema structures into FSA that I store in the DOM. I have tried several methods to validate my xml structures against the FSA and come short each time. The validator is being used to run a client side WYSIWYG XML editor so it has to meet the following requirements Must be efficient ( < 15ms to validate an element child node pattern even with complex models) Must expose a Post

Which is the best or easiest method for determining equivalence between two automata? I.e., if given two finite automata A and B, how can I determine whether both recognize the same language? They are both deterministic or both nondeterministic. Two nondeterministic finite automota (NFA's) are equivalent if they accept the same language. To determine whether they accept the same language, we look at the fact that every NFA has a minimal DFA, where no two states are identical. A minimal DFA is also unique. Thus, given two NFA's, if you find that their corresponding minimal DFA's are equivalent,

Does anyone have a solution for a basic, compact Finite state machine/automata written in Objective-C code? I am interested in reusable components so that the FSM have states added and actions defined that use reusable state classes. What you want is a rules engine... oddly, I was able to find only one for objective-C (BDRuleEngine) and that is rather out of date: http://eschatologist.net/bDistributed.com/index.html It might be the best starting point though, unless you want to port something. Radislav I've found a good solution. This is the best choice for Objective-C I have ever seen. Enjoy

Good afternoon, Does anyone know of an "out-of-the-box" implementation of Levenshtein DFA ( deterministic finite automata ) in .NET (or easily translatable to it)? I have a very big dictionary with more than 160000 different words, and I want to, given an inicial word w , find all known words at Levenshtein distance at most 2 of w in an efficient way. Of course, having a function which computes all possible edits at edit distance one of a given word and applying it again to each of these edits solves the problem (and in a pretty straightforwad way). The problem is effiency --- given a 7 letter