Разбор текста с символами #, %, &, * и знаком вопроса - Prof. Clyde P. Kruskal, Assignments of Computer Science

В данном тексте представлены символы #, %, &, *, а также знак вопроса. Их можно встречать в различных контекстах: в программировании, в HTML-коде, в текстовых сообщениях. В данном разделе мы попытаемся разобрать, в каких контекстах могут встречаться эти символы и каково их значение.

Typology: Assignments

Pre 2010

Uploaded on 02/13/2009

koofers-user-2q5
koofers-user-2q5 🇺🇸

8 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
 
  
 
       
 
          !
"#


!

  
"#


! 
      
"#


! 



 
"#


!



  
"#


!
$  % &   
$ 
'%       "# 
 
      


! 



  "  #
'%    
 
 () **"# "  +#  **"# "  ,#    
 
 () *- "  -#    
 
 ()  "  -*#    
*

Partial preview of the text

Download Разбор текста с символами #, %, &, * и знаком вопроса - Prof. Clyde P. Kruskal and more Assignments Computer Science in PDF only on Docsity!

Fall 2005 CMSC 452: Homework 1 Clyde Kruskal Due at the start of class Tuesday, September 20, 2005. Problem 1. Draw the deterministic finite state machine for each of the following: a) {w € {a,b}* : aa is not a substring}. ( (b) {w € {a, b}* se ( ch a is immediately preceded and immediately followed by a b}. (c d) {w € {a,b}* : both aa and bb are substrings}. (e) {w € {a,b}* : the number of a’s is divisible by 3 and the number of b’s is odd}. ) ) ) {w € {a,b}* : neither aa nor bb is a substring}. ) ) Give the full machine description for part (a) only. Problem 2. Draw the nondeterministic finite state machine for {w € {a,b}* : either aa or bb is a substring (or both are) }. Give the full machine description. Problem 3. Do Exercises 2.11(a) (page 58) and 2.11(c) (page 59) in Kinber and Smith. Problem 4. Do Exer 2.16 (page 60) in Kinber and Smith. Problem 5. Do Exercise 2.20 (page 61) in Kinber and Smith.