3
votes
Accepted
Are the set of all Bitcoin addresses a context-sensitive language?
Any answer I give you is likely to be unsatisfying and a little silly, both because we're squarely in theory-land here (and not the useful kind of theory, but theory that is irrelevant in practice), ...

D.W.♦
- 141k
3
votes
Accepted
DFA and NFA with 2 Substrings
Find an automaton for $L_1= \{uopv\mid u,v\in \Sigma^*\}$ and an automaton for $L_2 = \{upqv\mid u,v\in\Sigma^*\}$ (this should be easy enough).
Then, you can compute the product automaton of the two ...
1
vote
Accepted
Why is $L'=\{u\#v^R ~|~ u,v \in L\}$ and $L\in RL$ a regular language?
Regular languages are closed under reversal, therefore $L^R = \{v^R \mid v \in L\}$ is regular. Moreover, regular languages are closed under concatenation, therefore $L' = L \circ \{\#\} \circ L^R$ is ...
1
vote
How would I design a State Diagram (FSM) for a AC unit?
Your question's answer could be solved by Finite Automata with output that is Moore Machine or Mealy Machine.
You have three cases:
$Case:1$ When temperature is equal or more than $80°$ then output is ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
regular-expressions × 767regular-languages × 368
finite-automata × 271
formal-languages × 202
automata × 162
formal-grammars × 41
context-free × 39
pumping-lemma × 34
algorithms × 27
strings × 17
kleene-star × 16
parsers × 15
compilers × 14
nondeterminism × 14
complexity-theory × 13
computability × 12
proof-techniques × 12
closure-properties × 11
simulation × 11
terminology × 9
discrete-mathematics × 8
turing-machines × 6
pushdown-automata × 5
lexical-analysis × 5
programming-languages × 4