Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MAD 3512 - THEORY OF ALGORITHMS FLORIDA INTERNATIONAL UNIV. REVISION FOR TEST #1 REMEMBER TO BRING AN 8x11 BLUE EXAM BOOKLET FOR THE TEST : Alphabets, strings of letters, empty string λ, reverse of a string, concatenation of strings, languages (sets of strings), regular expression (REX ), L(E) = language described by E , equivalent regular expressions , regular languages; phrase-structured, context-free, linear & right-linear grammars; context-free, linear & right-linear languages; useless, unreachable, ; normal forms for CFGs and RLGs, parsing and parsing algorithms, derivations, generating tree of a grammar, L(G ) = language generated by G , equivalent grammars, derivation tree, leftmost derivations , ambiguous grammars, inherently ambiguous languages, finite state machines (finite automata), deterministic finite acceptors (DFAs), transition table, transition graph, extended transition function for DFAs, L(M) =
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/27/2011 for the course MAC 3512 taught by Professor Ramsau during the Fall '10 term at FIU.

Ask a homework question - tutors are online