(ab+ba)* accepts all zero or more "a"s followed by zero or more "b"s, and also zero or more "b"s, followed by zero or more "a"s. What is the reject state of this RE? Just think about the strings ...

Consider the following FSTs : T1 0 1 a : b 0 2 b : b 2 3 b : b 0 0 a : a 1 3 b : a T2 0 1 b : a 1 2 b : a 1 1 a : d 1 2 a : c How do I perform the composition operation on these two FSTs (i.e. ...

I m reviewing some notes for my course on Theory of Computation and I m a little bit stuck on showing the following statement and I was hoping somebody could help me out with an explanation :) Let A ...

I m working on a state machine which is supposed to extract function calls of the form /* I am a comment */ //I am a comment pref("this.is.a.string.which"can have QUOTES"", 123456); where the ...

I want to test whether two languages have a string in common. Both of these languages are from a subset of regular languages described below and I only need to know whether there exists a string in ...

Out of curiosity, I am trying to identify what model of computation a system I work with is functionally equivalent to, and prove the equivalence. The longer I spend on this problem the more I ...

First, this is not a question asking for the algorithm to convert a NFA to DFA. It s known (and proved) that the equivalent DFA of a NFA has at most 2n states, even though most of the times it will ...

我想开发一个工具,根据过渡表、利用Lex和Yacc进入邦和最后邦,构造任何精炼的汽车的过渡图。 工具还应为......提供设施。