Telegram group: T.me/BBCNOUN
[CIT342] A formal language is often defined by means of __________
formal grammar

[CIT342] Once the input word has been read, the automaton is said to have stopped and the state at which automaton has stopped is called_____________
final state

[CIT342] An automaton that contains some extra memory in the form of a stack in which symbols can be pushed and popped is called a ___________
pushdown automaton

[CIT342] If there are multiple ways of generating the same single string, the grammar is said to be__________
ambiguous

[CIT342] The processing of recognizing an utterance by breaking it down to a set of symbols and analysing each one against the grammar of the language is known as_________
Parsing

[CIT342] Depending on the _____________ it is said that the automaton either accepts or rejects an input word.
final state

[CIT342] To distinguish the words that belong to a language from arbitrary words over its alphabet, the former are sometimes called___________
well-formed words

[CIT342] A function in computing that determines whether a given string belongs to the language or is grammatically incorrect is called a _________
recognizer

[CIT342] In theoretical computer science, the study of abstract machines and the computational problems that can be solved using these machines is called___________
automata theory

[CIT342] Suppose L1 and L2 are languages over some common alphabet, the ________consists of all strings of the form vw where v is a string from L1 and w is a string from L2.
concatenation