'Csci 3130 automata theory' diaporamas de présentation

CSCI 3130: Automata theory and formal languages

Fall 2011. The Chinese University of Hong Kong. CSCI 3130: Automata theory and formal languages. NFA to DFA conversion and regular expressions. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. NFAs are as powerful as DFAs. An NFA can do everything a DFA can do

514 views • 32 slides

CSCI 3130: Automata theory and formal languages

311 views • 31 slides

CSCI 3130: Automata theory and formal languages

Fall 2010. The Chinese University of Hong Kong. CSCI 3130: Automata theory and formal languages. Text search and closure properties. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. Text search. The program grep. grep -E regexp file.

433 views • 30 slides

CSCI 3130: Automata theory and formal languages

Fall 2010. The Chinese University of Hong Kong. CSCI 3130: Automata theory and formal languages. Non-regular languages. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. A non-regular language. An example We reason by contradiction:

247 views • 24 slides

CSCI 3130: Automata theory and formal languages

Fall 2010. The Chinese University of Hong Kong. CSCI 3130: Automata theory and formal languages. Reducibility. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. Summary of last lecture. U. program ? M ?. accept , if M accepts w. reject , if M rejects w. input w.

235 views • 23 slides

CSCI 3130: Automata theory and formal languages

Fall 2010. The Chinese University of Hong Kong. CSCI 3130: Automata theory and formal languages. Pushdown automata. Andrej Bogdanov http://www.cse.cuhk.edu.hk/~andrejb/csc3130. Motivation. regular expression. NFA. DFA. syntactic. computational. is more powerful than. CFG.

262 views • 11 slides