Letting {a b} be the alphabet set, write a regular expression for: 1) The language of all those words in which the number of a\'s and the number of b\'s are both 开发者_StackOverflow中文版odd;
Testing reachability of a node in a graph (directed), can be done using cellualr Automata? Actually what\'s in mind, is to implement an algorithm that checks reachability of a开发者_开发百科 nod from
I have some badly formatted XML that I must parse. Fixing the problem upstream is not possible. The (current) problem is that ampersand characters are not always escaped properly, so I need to conver
i have a task to construct the PDA which recognizes the language A= {a^m b^n | m > n} with ∑ = {a, b}.. i\'m a bit confused how to do it.. can you guys help me to solve thi开发者_开发知识库s question
Not quite sure if this is the correct forum, but it was suggested at Theoretical Computer Science that I move it here...
Ca开发者_StackOverflow中文版n someone tell me how a Transducer differs from a NFA?Transducers have two tapes (input and output). NFAs only have one.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
I\'m trying to construct a regular expression from a Finite Automaton but found my self completely stuck with this one. The regex to use is like this:
I wanted to ask if there are algo开发者_如何学运维rithms (also already implemented) for checking emptiness of an alternating automaton in particular a weak alternating automaton.There\'s an implementa
I have a task where I need to take some existing pictures[ which show some automata (DFA, NFA, Turing machines)] and somehow convert them into a format, which enables me to use the data to represent i
加载中,请稍侯......