glitch

assign an n-bit key to each vehicle. the first few bits indicate the owner id(obviously theres an id field for each owner also). the last few are for unique identification. sort the list of owners in the database. then, everytime u have a vehicle, you can use a binary search to find the owner efficiently, and if you have an owner, its easy to find his vehicles. since were using bitfield entries instead of strings, it occupies much less place in memory, and its still efficient.

Transportation may be possible, but from a purely physics point of view,transportation to cyberspace isnt an option. Cyberspace is purely virtual. it has no physical component. From the basic laws of matter, matter cannot be created of destroyed. So in essence, the idea of teleporting to cyberspace is in essence the same as disappearing from existence.

hi. im glitch im into computer science. love to get into cryptography or AI. So if anyone has some interesting info on those subjects, i would love to hear them. Still in undergrad though, so id really like to know where to start if anyone has any ideas.

Im not sure exactly what erikduop said, but my understanding is that any NFA will not accept a string that is prematurely terminated. The advantage of NFA is that there are several paths which can be taken, allowing us to choose the right path in retrospect. If all paths terminate without reaching a final state, the string will not be accepted as part of the language.

try using pumping lemma theorem to prove it is regular. its much easier as you can handle it as a regular expression itself