instruction stringlengths 35 29.1k |
|---|
In a directed graph i want to call bfs on some of the vertices so that all of the vertices will be met.
(in other words all of the other vertices are reachable from these chosen vertices.)
I want to find the minimum number of such vertices.
Actually this problem arises in social networks when we want to find the minimu... |
I want to develop an interpreter. In the language, you have values and variables and types. The literals (the values) belong to some basic type. The subtypes can constrain the range of values. The spec says that making assignment, we ensure that the value assigned is assignable to the target (variable) range. Is it wor... |
I have been reading Karp's famous paper on the NP-Completeness of different problems, Reducibility among combinatorial problems, and I have a question on the reduction from SAT to 0/1 Integer Programming defined there.
The problem 0/1 Integer Programming is defined as:
Input: Integer matrix $A$ and integer vector $d$
P... |
I need to solve the following recurrency: $T(n) = 2T(\sqrt{n}) + O(1)$. It's for a simple undergrad problem that a student asked me, but I really couldn't solve it. Since it is for an undergrad question, it would be nice to solve it only with algebraic manipulation and reduction to a well known recurrence, or in the en... |
Let $\mathbb{M}$ be the set of all 3D triangle meshes.
Let $a:\mathbb{M} \rightarrow \mathbb{R}$ be a function that computes surface area of the mesh.
Let $\mathbb{T}$ be the set of 3D affine transformation matrices.
Let $t:\mathbb{M} \times \mathbb{T} \rightarrow \mathbb{M}$ be a function that transforms mesh $M$ with... |
I'm a researcher working with a language that has gone through phonological changes through time. I would like to tag parts of a word (i.e. prefix, stem, suffix) and then apply those phonological changes and then see what is left or different about the stuff that I tagged.
I'm currently using Python with some regex st... |
Let's suppose I have an image of a person and its corresponding background. Using OpenCV I can relatively easily get a silhouette of the person from the image.
I am doing a project on human recognition using silhouettes and the only things I came up with for feature extraction are so called Granlund coefficients deriv... |
This is an exercise I've been struggling with for a while:
Let $g : \mathbb{N} \to \mathbb{N}$ be a total, non-decreasing function, i.e. $\forall x > y.\ g(x) \geq g(y)$. Is the image $I_g$ of $g$ a recursive set?
Intuitively, I know that the image $I_{g}$ is not recursive, as $g$ is not strictly monotonic. In fact,... |
Suppose that I want to optimize a unimodal function defined on some real interval. I can use the well-known algorithm as described in Wikipedia under the name of ternary search.
In case of the algorithm that repeatedly halving intervals, it is common to reserve the term binary search for discrete problems and to use t... |
I'm totally new to DFA's and automaton in general -- this is the first week or two of class that I've actually seen this -- and I'm curious as to a pattern to match the following:
"Match the set of all strings on the alphabet {a, b} that have at least one b and exactly 2 a's"
I've tried to construct a DFA to represen... |
In my project, there is one important step to automatically verify a timed automata with TCTL formulae. I briefly surveyed the tool UPPAAL that provides a GUI to construct a timed automata and to specify CTL formulae. However, I didn't find the api to invoke.
Is there any tools with api provided for verifying TCTL form... |
I am looking for an algorithm to convert a digraph (directed graph) to an undirected graph in a reversible way, ie the digraph should be reconstructable if we are given the undirected graph. I understand that this will come in expense of the undirected graph having more vertices but I do not mind.
Does one know how to ... |
I'm trying to write an algorithm that detects the most common subset of at least size $k$, from a collection of sets. If there are ties for the most common subset, I want the one of them whose size is as large as possible.
For example if I have:
s1 = {A, B, C }
s2 = {A, B, C, D}
s3 = { B, C, D}
Then the most comm... |
Is there a lower bound on the running time for solving 3-SAT if P = NP. For instance, is it known that 3-SAT can't be solved in linear time? What about quadratic?
|
I have to generate all possible paths in a directed, acyclic weighted graph with edge costs. I also have to sort them in order of shortest path.
The simplest way that comes to mind is to do a depth-first search (DFS) for all paths, accumulating their edge costs as I traverse the paths, and then doing an NlogN sort on ... |
I'm going to take the few pieces of knowledge I have about lambda calculi and ask a pair of very uninformed questions :-)
Is it possible to "embed" the corners of the lambda cube within the untyped lambda calculus?
It would seem that this might lead to a language where the programmer implements the type system in the... |
Given is the definition of a general problem: $\{ \langle M, S\rangle \mid M \text{ is a } TM, L_M \in S\}$. In words: Given a TM M, does M decide a language that is an element of the given set of languages S?
I'm stuck with the following instance of that problem: $L = \{ \langle M \rangle \mid M \text{ is a } TM, L_M... |
I know this is probably very basic, I just can't wrap my head around it.
We recently studied about Dijkstra's algorithm for finding the shortest path between two vertices on a weighted graph.
My professor said this algorithm will not work on a graph with negative edges, so I tried to figure out what could be wrong with... |
I've been working on the following exercise:
$S = \{ x | f_x \text{ is constant} \}$. Is $S$ recursively enumerable?
Here, $fx$ is the function computed by the $\text{x-th TM}$. So it is a computable function.
Intuitively, I think that to check if $S$ is constant, I would have to check if $f_x$ stops for every inpu... |
I am learning about temporal logic and model checking systems. One conceptual exercise that I am struggling with is how to create a transition system which satisfies only one of two given properties, when one is in LTL and one is in CTL. For example:
Find a transition system that satisfies only one of the following tw... |
I am looking at the following non-deterministic finite automata which accepts all strings that end with at least 2 bs. I am wondering what would happen when you have the input string 'abba' with this automata:
The possible computations I have so far are
q0, q0, q0, q0, q0
q0, q0, q1, q2, ??
q0, q0, q0, q1, ??
Would a... |
For school, we have a proof that some functions are not Turing computable.
The example is:
$$ G(k) = \begin{cases} f_k(k) + 1 & \text{ if $f_k(k)$ is defined}, \\ 1 & \text{ otherwise}.\end{cases} $$
Claim: $G$ is non computable.
Proof: In view of obtaining a contradiction, let's say $G$ is computable, say by the $k$th... |
In another question about Lambda Calculus, Andrej Bauer made the comment:
Lambda calculi of various forms are formal systems. They consist of
abstract syntax (for terms and for types, if present), judgments
(typing judgments and equations), and rules of inference. They are not
programming languages (unless we pr... |
I am looking for papers/methods (or at least problem examples) where the original search problem $P$ can be solved by either:
Searching through the original graph. or
By decomposing it into several subset of problems $P_1,P_2, \dots,P_n$.
Ideally $sol(P )=sol(P_1)\cup sol(P_2)\cup \ldots \cup(P_n)$ with no preprocess... |
It may be a dumb question, but is $\mathsf{DSPACE}(f(n)) \subset \mathsf{NSPACE}(f(n))$ or is $\mathsf{DSPACE}(f(n)) \subseteq \mathsf{NSPACE}(f(n))$? In other words, is the containment relation proper or not? Wikipedia says the first one, while the ComplexityZoo says the other one.
|
Consider a two-dimensional grid with wrap-around edges (a doughnut-shaped graph). I need to calculate the second-largest eigenvalue of the adjacency matrix. Is there a faster way of computing it for such a special graph than a general method such as the "eigs" function in MATLAB?
|
I am searching the content of this topic but I am not sure what should be the content for this topic. This is relate to Computer Network.
My topic is Physical layer services & hardware protocols.
What should be content for this topic.
|
Is $L=\{a^nb^m|m\geq2^n\}$ a context-free language?
|
I understand that the 3-Opt Heuristic for solving the Traveling Salesman problem involves removing three edges from a graph and adding three more to recomplete the tour. However, I've seen many papers that mention that when three edges are removed, there remain only 2 possible ways to recombine the tour - this doesn't ... |
I read a proof on the closure of decidable languages under kleene star. It begins by saying that the turing machine we want to find would non-determistically split the input string and then use the original decider of the language to approve the partition of each branch.
My question is, I can't understand how we can do... |
I have to prove or disprove the implications in these two situations
$L^* = \emptyset$ $\rightarrow$ $L$ is infinite
$L^+ = \emptyset$ $\rightarrow$ $L$ is infinite
Here are my thoughts.
I would say Kleene star operation (*) is union of
$\qquad L^0 \cup L^1 \cup L^2 \cup \dots$
and since $\_^0 = \{\epsilon\}$ (even... |
Let $h$ be a total computable function. Is $S = \{x \mid f_x \neq h\}$
recursively enumerable?
Originally this was an exercise that restricted $h$ to: $h(x) = x + 1$ . However, it can be formulated as a more general case.
By Rice's Theorem, it is not recursive. Intuitively,
$S$ is not r.e. as if it was, it would ... |
I'm trying to learn automata theory on my own and I am running into an issue with the second part of the question:
We say B is transitive if $BB\subseteq B$ and reflexive if $\epsilon \in B$
Show that A* is a reflexive and transitive set containing A and if B is any other reflexive and transitive set containing A, the... |
The work of Martín Escardó has demonstrated close parallels between classical topology o one hand and computability on the other hand. (See for example "Infinite sets that admit fast exhaustive search" 22nd Annual IEEE Symposium on Logic in Computer Science (2007) 443–452)
Escardó identifies continuous functions with... |
This was asked in a recent contest.
The question asked to count the number of ways to color an $M \times N$ matrix with $K$ colours such that no two adjacent cells (sharing an edge) have the same color.
In other words, I want to count the number of different graph colorings of a grid graph: the graph of a $N \times M$ ... |
There're a lot of examples of code for checking if a number is prime. Why don't people use Fermat's little theorem, i.e. this simple formula
$\qquad a^{p-1} \equiv 1 \pmod p$,
to check if a number is prime?
|
I've seen in previous exams that professors marked the theory as correct:
If $L$ is CFL and $\overline{L}$ is CFL, then L is regular.
I just don't see how this would work. How would we prove such a thing? I also can't come up with contradicting languages.
|
I understand the restrictions, because a regular language is expressive enough to allow all types of tokens. And even if some context is needed in many languages to tokenize properly, they all seem to be "approximately" regular languages.
Yet I would be interested if any attempt in any programming language, possibly es... |
I recently was introduced to solving recurrence bounds by substitution but there's something i don't understand about it.
In standard induction proofs you prove a base case, assume it holds for n then show it holds for n+1 and therefore show it applies to integers larger than the base case.
For when you solve recurrenc... |
I'm studying about Local Binary Pattern and I'm having trouble understanding the following part about the number of output labels for binary patterns from Computer Vision using Local Binary Patterns, by Pietikäinen et al. (2011):
Another extension to the original operator uses so called uniform patterns [53]. For this... |
I'm working on semi automatic texture segmentation using level set and gabor feature vector described by Manjunath und Ma [1]. I consider their feature representation is better than others since I can get good result on several images but somehow performs really bad on other images data. So I guess there's something w... |
Seemingly, a byte has established itself to be 8bit (is that correct?). RAM and NOR-flash can be normally accessed on a quite granular level, but it is up to the system architecture to determine if the smallest addressable unit is 8bit, 16bit or any other power of two bit number. Would the correct terminology be to cal... |
I am involved in a first year programming and algorithms course. In a recent lecture, I decided to present the material using live coding, which essentially meant that I sit behind the keyboard and write code and evaluate it, using emacs to facilitate the process.
This was quite successful and students commented on how... |
I am working on the following problem:
Suppose that $T$ is a spanning tree of a graph $G$, with an edge cost function $c$. Let $T$ have the cycle property if for any edge $e' \not \in T, c(e') \geq c(e)$ for all $e$ in the cycle generated by adding $e'$ to $T$. Let $T$ have the cut property if for any edge $e \in T... |
Consider an unknown function $f(x,y)$, where $x$ and $y$ are just two scalar numbers in $[0,1]$. $f(x,y)$ is an increasing function of $y$ and is between $0$ and $1$ but is unknown.
At each time I pick a value $y$ and process a value in a stream of $x$ numbers $x_i$, $i=1, 2, ...$ and need to find the minimum $y$ such ... |
As in title. Does $NSPACE(n) \subseteq DTIME(2^n)$ ?
|
I have recently summarized several algorithms for the maximum disjoint set problem. This problem is NP-hard, but it has both PTAS and sub-exponential algorithms. These algorithms seem to me closely related. The details vary, but the general idea is:
For a PTAS: remove a small fraction of the input set (e.g. $O(\sqrt{n... |
I have a timeseries dataset of a quantity measured over the period of a week. I want to verify if the data is varying in a diurnal fashion with the help of some mathematical measure. Does any such measure exist?
|
I have an m x n matrix which is sparse with N non-zero entries. A modified version of Kadane's 2-d algorithm can find the maximum sum subrectangle in O(m N log n) time, which beats traditional Kadane's 2-d algorithm of O(m^2 n) for sufficiently sparse matrices. The sparse matrix algorithm, which is also O(m^2 n) time f... |
Graphs with degree $\Delta$ have a maximum independent set of size $\alpha \geqslant \frac{n}{\Delta}$ where $n$ is the number of vertices.
But, are there graphs such that $\alpha \approx \frac{n}{\Delta}$, or even $\alpha = c \frac{n}{\Delta}$ for some constant $c \leqslant 1$?
|
Given the problem $EQ_{TM} = \{ \langle M_1, M_2\rangle \mid M_1 \text{ and } M_2 \text{ are } TM, L_{M_1} = L_{M_2}\}$, is it possible to prove that this is undecidable by using (a variant of) Rice theorem?
I have proven this problem by reduction to $E_{TM}$, but was wondering if it was easier to do with Rice.
|
When defining a Turing Machine formally, you enumerate its states. But I don't understand what states a TM can be in. Reading, Writing, and moving the head are the only ones that come to mind.
Specifically, the turing I am trying to describe behaves like this:
WHILE the symbol under the FH head is not $ DO
... |
Is it possible to simulate a regular Turing Machine with a TM with the following specs?
There are two heads, one of which can read, one of which can write
Both heads can only move right
When a head reads (or it writes) it moves right
I know it's possible to simulate a TM that only moves right. But, is it possible to ... |
I am new to statistical learning. I have a structure $X$ where I showed its hypothesis class $H$ has VC dimension $d$. All I know now is that I can bound the number of examples by $m\geq \frac{1}{\epsilon}ln \frac{d}{\delta}$ and with probability at least $1-\delta$ I will get a hypothesis with error at most $\epsilon$... |
If someone realizes that a computer language is deficient under some aspect or the other, couldn't he just create a library for the new language instead of a new language?
Couldn't you have a library In C that lets you process list as if they were lisp? Or that write simple code as if it was Python?
Why does evolution ... |
Almost all type-theoretical treatments of references that I've studied introduce references as accompanied with at least three operations (sometimes including the fourth):
Construction (allocation): $ \text{ref } e $
Elimination (dereferencing): $ !e $
Updating: $ e_1 := e_2 $
(not as common) Destruction (deallocation... |
I am looking for an automated way to answer the question: what are the URLs on the world wide web that contain at least two strings from a set of strings.
So if I have a set of strings {"A", "B" and "C"} -- I want to know, what pages on the world wide web contain "A" and B", "A" and "C", "B" and "C" or "A", "B" and "C... |
I am undertaking a module in Concurrent Programming where some of the new content this year covers linearizability, the Java Memory Model, and sequential consistency. Our class slides are companion slides to The Art Of Multiprocessor Programming.
I have been doing OK with linearizability but have become confused at thi... |
What is the most efficient algorithm for finding the median of an array when the available operations are limited to Max(), Min(), Multiply, Add, and no conditionals are allowed. Pivots and sorts are not allowed. The algorithm I have come up with so far seems very inefficient and goes like so:
For an array of length n... |
So, I've got this problem:
Given a string $\omega\in\{0,\ldots,9\}^*$, find the smallest prime number (in base 10) that contains that string, or otherwise returns 0.
What I'm asking is a fast algorithm for the problem?
|
Calculate the exponential averaging with $T_1 = 10$, $\alpha=0.5$ and the algorithm is SJF with previous runs as $8,7,4,16$.
9
8
7.5
None
I am getting 4. None as the answer.
But it is given that 3. 7.5 is the correct answer.
I think I am missing something here.
Because I only used the formula, $S_{n + 1}{}{}{}{... |
I'm following the algorithm for left recursion elimination from a grammar. It says remove the epsilon production if there is any.
I have the grammar
$\qquad S \to Aa \mid b$
$\qquad A \to Ac \mid Sd \mid \varepsilon$
I can see after removing the epsilon productions the grammer becomes
$\qquad S \to Aa \mid a \mid b$
$\... |
I am writing a sprite sheet generator tool in adobe AIR, and I have to force with the question: How to pack a collection of 2D rectangles to smallest possible 2D rectangle with power of two. (like 1024x444).
I think that this question is NP-Hard. I found good answer for it here.
I thought about another option. What if ... |
What is the point of non-binary printed letters on a turing machine? I understand that these need to be omitted to get a computable number, but why are they used in the first place?
|
I was thinking about any method where we can use RAM I/O speed, to calculate time, let's say for example:
RAM transfer rate is 1000 MB/s, so when it's half full (about 500 M Bytes written), by dividing 500 by 1000 we get the time which is epoch + 0.5 seconds
so all in all we have three routines:
one for writing data (... |
Yes, I borrowed the title form a famous joelonsoftware post for my question because I didn't exactly know how to ask this.
I'm a professional programmer for a few years now and although I followed informatics courses in school there was a lot of stuff missing from the curriculum, as I now know but wasn't aware then. Fo... |
Recently i've been dealing with a problem that led me to the following questions:
Is there a good algorithm to enumerate all maximum/perfect matchings in a general graph?
Is there a good algorithm for finding all maximum/perfect matchings in a general graph?
Are these two problems equivalent in their complexity?
I've... |
As the title states, I am asking for how the big-O in asymptotic analysis is used in theoretical computer science. It would be helpful if an example would be given.
|
I was trying to understand better the definition of a strong PSRG and I came across this expression which I am trying to understand better:
$$ Pr_{r \in \{0,1\}^l}[A(r) = \text{"yes"}]$$
Where r is a truly random bit string and A is a polynomial time deterministic machine.
I've been having some problems understanding w... |
I've not clear how to pass from final interval to code value, for example:
Suppose we have the set of symbols={0,1,2,3} with probability={0.2, 0.5, 0.2 , 0.1} and that we have to encode a source S={2,1,0,0,1,3};
After the encoding process we'll have an interval $[ 0.7426, 0.7428 ) $.
Now the final step is to find the s... |
I know that the language $\{a^m b^n | n\neq m\}$ satisfies the pumping lemma, but it's still not regular (I have to count the # of a's and b's).
How can I formally prove it?
|
I've been trying to teach myself some machine learning, and I wanted to ask what seems a simple question, but I've not been able to find any resources that explain the next step.
Let's say I am doing semi-supervised learning, and have a few hundred sparsely distributed feature extractors, trained on random 32x32 region... |
I'm studying for my Computing languages test and there's one idea I'm having problems wrapping my head around, as far as I know for any Context Free Grammar (CFG), we can design a 2-state Pushdown Automaton (PDA). I am however a little bit confused that why this is possible.
|
I am a little bit confused on one idea regarding indexed languages.
$\{ww \mid w \in \{a,b,c\}^* \}$ is a linear indexed language, but
$\{www \mid w \in \{a,b,c\}^* \}$ is not a linear indexed language.
What is the difference? As far as I know, indexed languages can be recognized by stack automatons, but I am a litt... |
Prove/disprove: $\exists L \in RE/R$ such that $L^R \cup L \in R$
Where in my context, $R$ is the turing decidable, and $RE$ is the recursively enurmable. I tried to find such an $L$ but couldn't. What I know for sure is that I need a language in $RE/R$ such that $L \cup L^R = \Sigma^*$, or am I also wrong?
|
I have this question about if the decidability of an regular expression and would appreciate if someone can check my answer and see if it makes sense, and if not, what is missing.
Be A = {(R)|R it is a regular expression that describes a language containing at least a w string that has 111 as a substring (that it is, ... |
I have two questions about how to use pumping lemma for regular languages to show that two languages are not regular. I would appreciate if someone can confirm if my answers make sense, and if not, what needs to be done
1) Prove that the following languages aren't regular. You can use the pumping lemma and the closing ... |
I have this question about closure of a context free grammar, and if someone can check my answer and see if it makes sense, and if not, what is missing, I would be very grateful.
Give an counter-example to show that the following contruction fails in to proof that class of languages free of context is closed under the... |
For example, can I make a compiler that transforms a C program (Turing complete language) into a bunch of SAT instances.
This encoding would be motivated as a way for specifying a problem piecemeal, where work on each piece could be verified in polynomial time.
|
Why do we use other bases which are neither binary (for computers) nor decimals (for humans)?
Computers end up representing them in binary, and humans strongly prefer getting their decimal representation. Why not stick to these two bases?
|
When translating an NFA into an equivalent DFA, we can say that all
states that contain the final states of NFA, is the final state of
DFA.
What should my arguments be in order to prove this?
|
We have been given 2 points on a circle and its radius. Now I want to find out the centre point of such a circle. How can I code this efficiently without solving the quadratic equations?
|
I have a recursive algorithm defined by the following recursion.
$$T(n) = T(n/f(n)) + O(\log f(n)).$$
I want to find the function $f$ that minimizes $T(n)$. If $f$ is a constant then $T(n) = \Theta(\log n)$. If $f = O(n)$ then $T(n) = \Theta(\log n)$. Is this true for all functions $f$ that $T(n) = \Omega(\log n)$ or c... |
I'm having trouble figuring out how to create admissible heuristics from cost functions. For example, if I was trying to create an admissible heuristic from a cost function that takes in starting position and ending position and returns the cost based on differences in height, I don't understand how to create an admis... |
Firstly, I am revising for my Concurrent Programming exam and have come across the following question from a previous exam paper. I have attempted to answer it, and will try and convey this effort; I'm very stuck with this question and not sure how to further progress.
Question
This question is from a 2011 Past Paper f... |
Suppose I have a list of distinct integers. I'm looking for a data structure that will support the operations search, insert, delete and closest_pair in $O(\log n)$ time.
I know that a sorted array supports search, insert and delete in $O(\log n)$ time. So, all we need to do is maintain information about the closest p... |
I've been watching lectures from Coderisland on YouTube about finite state machines, DFAs and NFAs, and in one discussion he talks about how to use the pumping lemma to show how a language is not regular. I don't know quite how to apply the lemma and want to understand if I'm doing it right. If I had something like:
w ... |
When looking at concurrent programming, two terms are commonly used i.e. concurrent and parallel.
And some programming languages specifically claim support for parallel programming, such as Java.
Does this means parallel and concurrent programming are actually different?
|
Say I have variables $w_1, \dots w_n, h_1, \dots h_m \in \mathbb R$, constants $W, H$, functions $f_1, \dots f_k : \mathbb R\times\mathbb R\to\mathbb R$ from some family $F$ and for each function $f_i$, a pair of intervals $x_i \subseteq [1, n]$, $y_i \subseteq [1, m]$. All quantities $\geq 0$.
I want to find the $w_i$... |
This is a question from an exam I did today:
Given $M$, a turing machine, we need to decide the following:
1) $M$ halts on every input
2) The language of $M$ is CFL
My question is, can I prove that this problem is not in $RE$ (recursively enumerable) using Rice's theorem? I understand that Rice's theorem works for la... |
Yes, this is a homework question, I've tried working it out and was hoping I could get pointed in the right direction.
Here's the question:
You are designing the instruction set for a new type of computer. The
computer has 64 instructions, 16 general-purpose registers. It supports a
byte-addressable memory of up-to 32M... |
In the accepted answer to my question Data Structure For Closest Pair Problem, I do not see why deletion works.
Let's say (x, y) are the closest pair before the delete. If the node to be deleted is either x or y, then we would have to recalculate the closest pair, which would not satisfy the O(log n) requirement. The b... |
Is there any way to get an equivalent of computing power of quantum computers in terms of computing power of common computers? I mean, how many teraflops (or so) can a quantum computer compute? How can I calculate that equivalence? I think it depends on the architecture, like a x64 in common computer, and a 512-qubit.
|
How many flops my brain can process, or how many GHz is a human brain capable of?
Is it valid to think that each celular brain is like a small cpu? (like cuda architecture). Our brains works in parallel, right?
|
Hello I am trying to solve the AlienTiles problem described at alientiles.com using the A* algorithm but I cannot find any good heuristic function so far.
In AlienTiles you have a board with $N \times N$ tiles, all coloured red. By clicking on a tile, all tiles in the same row and column advance to the next color, with... |
I'm interested - is it possible to implement algorithm which could compare 2 video files and answer, are they the same with some level of precision.
Is currently exist some methods which allow to solve that problem effectively?
The same - means like this. Let's assume we have a video file. All files created from this b... |
When talking about general data structure design, my lecture notes talk about one of the concerns being cost of operations. As well as the individual cost, it mentions amortized cost. But then it goes on to say:
Amortized cost can be:
absolute (e.g. for every sequence σ of operations (O(n log n))
competitive (e.g. fo... |
I am taking a course in the theory of computation and am trying to understand how to correctly design NFA's so that I can transform them into regex. I was wondering if I have Sigma={a,b} and need to design a NFA over Sigma Star that has at least one of its last 2 characters to be an 'a'; Can I simply start 2 threads, o... |
I plot several arrays containing xy-coordinates of points (using plot(x,y)) and obtain a plot with some curves. The curves form some very distinctive closed shapes (that is, the points describing the curves lie close to each other).
Now I need to find the (possibly approximate) centers of the closed shapes. Alternative... |
Let $A$ and $B$ be regular languages. Let $C$ be their difference, i.e $C = B \setminus A$.
Given NFAs for $A$ and $B$, is it possible to directly construct an NFA for $C$ without (implicitly or explicitly) converting them to DFAs first?
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.