The normal-forms tag has no wiki summary.
1
vote
1answer
72 views
Are all databases reducible to this ultimate abstract database design?
I've designed a few databases in my time, and on more than one occasion the drive to abstract common elements from specific tables has led me to create generic top-level tables which contain those ...
2
votes
1answer
23 views
Chomsky form for language of single alphabet member
I'm a bit confused as to how to represent the Chomsky form for the language L that generates all strings with the alphabet {a}
My approach was
...
2
votes
2answers
70 views
The importance of normal forms like Chomsky normal form for CFGs
I understand that context-free grammars can be used to represent context-free languages.It might have ambiguities. We also have normal forms like Chomsky and Greibach normal form. I couldn't ...
1
vote
1answer
62 views
CFG to Chomsky normal form
I've read this part like 3-4 times and I'm not understanding what is going on.
Let G6 be the following CFG and convert it to Chomsky normal form by using the conversion procedure just given. The ...
0
votes
0answers
55 views
Converting first-order formula to CNF
I need to convert this statement to CNF (Conjunctive normal form):
$\qquad \left((\forall x.\, P(x)) \implies Q(a)\right)\implies \left((\exists y.\, P(y)) \implies Q(a)\right)$
I got this answer:
...
3
votes
2answers
159 views
“Applicative order” and “Normal order” in lambda-calculus
Applicative order: Always fully evaluate the arguments of a function
before evaluating the function itself , like -
$(\lambda x. x^2(\lambda x.(x+1) \ \ 2))) \rightarrow (\lambda x.
...
3
votes
1answer
125 views
3CF 3-conjunctive form satisfiability
I am self studying discrete math and I am going through MIT Mathematics for CS lecture notes but they do not have solutions available. I got stuck at Problem 3.14 (pages 64-65 of this document). The ...
