JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
NLP 2021 @ BGU.CS
Lecture #02 / Quiz #01
Sign in to Google
to save your progress.
Learn more
* Indicates required question
Email
*
Your email
List two differences between the task of testing that a sequence belongs to a formal language in the Chomsky hierarchy and evaluating a language model on a sequence
Your answer
Give the grammar (a set of rules) for the language that contains strings of the form a^n b^n (that is, a sequence of 0 or more a's followed by the same number of b's)
Your answer
Is the language { a^n b^n } a regular language?
Yes
No
Clear selection
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
