8/20/2019 theory of computation - WordMint

Name: ___________________________________________ Date: ___________________

theory of computation
1 2
A A
3
C M M
4
R O O T B B
5 6
N I R P I
T G I R G
7
M O O R E U G O U
8
P X O H D O
9
A A U T O M A T A U T U U
R F S M C S
S R G O T
10
E R E G U L A R E X P R E S S I O N
T E A T O
11
R P U M P I N G L E M M A N
E A M
12
E F I N I T E
13
D G R
F U
14
R E G U L A R L A N G U A G E S
G
15
M E A L Y

Across Down
4. node of the tree is labelled by start 1. grammar having two LDT are called
7. machine whose output depends on only present state 2. CFG which exist two or more parse tree
9. the finite ____ is a mathematical model of system 3. higher level language than Regular Language
10. used to denote regular languages 5. derivation of production only to rightmost variable

https://wordmint.com/puzzles/1497361 1/2
8/20/2019 theory of computation - WordMint

11. theorem which talks about a typical property of CFG 6. S-->aAS|bA|a represent which rule
12. automata with finite number of states 8. derivation tree are:
14. expressed in the terms of regular expression 13. has a finite set of states
15. machine whose output depends on the present state or present input

https://wordmint.com/puzzles/1497361 2/2