I wonder if someone could take a minute out of their day to give their two cents on my problem. I would like some suggestions on what would be the best data structure for representing, on disk, a lar
The (directed) graphs represent finite automata. Up until now my test program has been writing out dot files for testing. This is pretty good both for regression testing (keep the verified output file
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 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 bot
There are languages that a Turing machine can handle that an LBA can\'t, but are there any useful, practical problems that LBAs can\'t solve but TMs can?
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references,or expertise, but this que开发者_Python百科stion will likely
I have a problem where I really need to be able to use finite automata as the keys to an associative container. Each key should actually represent an equivalence class of automata, so that when I sear
I want to开发者_运维问答 apply rules of BNF Grammar to produce derivation for : a_NumYour question is a bit vague. But below is a BNF (ish) grammar for an integer number.