I'm reading theory of computation and I've a question which I don't know where to ask but here,
If DFA M recognizes language A and language B, can we conclude that A = B?
I'm following 2nd edition of Sipser's book, if that's important.
I'm reading theory of computation and I've a question which I don't know where to ask but here,
If DFA M recognizes language A and language B, can we conclude that A = B?
I'm following 2nd edition of Sipser's book, if that's important.
GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.
All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.