Datalog is not Turing complete. But what is its computational class? Is it equivalent to Finite state machine or Pushdown machine (i.e. context free) ... or is it something in between?

I want to search a text document for occurrences of keyphrases from a database of keyphrases (extracted from wikipedia article titles). (ie. given a document i want to find whether any of the phras...

Which is the best or easiest method for determining equivalence between two automata? I.e., if given two finite automata A and B, how can I determine whether both recognize the same language? The...

I'm trying to a develop a simulation that executes a non deterministic finite automaton in Java. The first command line argument is a text file that defines the machine. The second argument is an i...

I'm new to threads and I was wondering how to use them to make an evaluation in a non deterministic finite automaton. I have the method that calls another method: public bool Evaluate2(string s) ...

Let's say that I have a list of regular expressions (read from an external source - file, database etc). I want to check which of these regular expressions a string matches. I can create iterate t...

What is a good way to represent finite automaton in Haskell? How would the data type of it look like? In our college, automata were defined as a 5-tuple (Q, X, delta, q_0, F) where Q is the se...

I am doing an assignment for simulate a nondeterministic finite automaton, just as I explain in this post. I have this input read from the file tarea4.in: 1 6 8 0 2 2 5 0 0 a 0 1 a 1 1 b 1 2 c 1 3...

I'm doing an assignment for automata theory, which I have to determine whether a word is accepted or not by a transition function for a deterministic finite automaton I have this input file: 6 8 ...

I'm writing a stream transformer from some Input data type to an Output data type. Input is made by the user, so there is some time between the events. Because each input requires some resource loa...