1 / 59

Discrete Maths

Discrete Maths. 242-213 , Semester 2, 2013-2014. Recogni z ing input using: automata : a graph-based technique regular expressions : an algebraic technique equivalent to automata . 13 . Automata and Regular Expressions. Overview. Introduction to Automata Representing Automata

nicki
Télécharger la présentation

Discrete Maths

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Discrete Maths 242-213, Semester 2,2013-2014 • Recognizing input using: • automata: a graph-based technique • regular expressions: an algebraic technique • equivalent to automata 13. Automata andRegular Expressions

  2. Overview • Introduction to Automata • Representing Automata • The ‘aeiou’ Automaton • Generating Output • Deterministic and Nondeterministic Automata • Regular Expressions • UNIX Regular Expressions • From REs to Automata • More Information

  3. 1. Introduction to Automata • A finite state automaton represents a problem as a series of states and transitions between the states • the automaton starts in an initial state • input causes a transition from the current state to another; • a state may be accepting • the automaton can terminate successfully when it enters an accepting state (if it wants to)

  4. 1.1. An Example The ‘even-odd’ Automaton b • The states are the ovals. • The transitions are the arrows • labelled with the input that ‘trigger’ them • The ‘oddA’ state is accepting. b start a evenA oddA a continued

  5. Execution Sequence b a b a a evenA initial state • InputMove to State b a b a a evenA the automaton could choose to terminate here b a b a a oddA b a b a a oddA b a b a a evenA stops since no more input b a b a a oddA

  6. 1.2. Why are Automata Useful? • Automata are a very good way of modeling finite-state systems which change state due to input. Examples: • text editors, compilers, UNIX tools like grep • communications protocols • digital hardware components • e.g. adders, RAM very different applications

  7. 2. Representing Automata • Automata have a mathematical basis which allows them to be analysed, e.g.: • prove that they accept correct input • prove that they do not accept incorrect input • Automata can be manipulated to simplify them, and they can be automatically converted into code.

  8. 2.1. A Mathematical Coding • We can represent an automaton in terms of sets and mathematical functions. • The ‘even-odd’ automaton is: startSet = { evenA } acceptSet = { oddA } nextState(evenA, b) => evenAnextState(evenA, a) => oddAnextState(oddA, b) => oddAnextState(oddA, a) => evenA continued

  9. Analysis of the mathematical form can show that the ‘even-odd’ automaton only accepts strings which: • contain an odd number of ‘a’s • e.g. • babaa abb abaab aabba aaaaba …

  10. 2.2. Automaton in Code • It is easy to (automatically) translate an automaton into code, but ... • an automaton graph does not contain all the details needed for a program • The main extra coding issues: • what to do when we enter an accepting state? • what to do when the input cannot be processed? • e.g. abzz is entered

  11. Encoding the ‘even-odd’ Automaton enum state {evenA, oddA}; // possible statesenum state currState = evenA; // start stateint isAccepting = 0; // falseint ch;while ((ch = getchar()) != EOF)) { currState = nextState(currState, ch); isAccepting = acceptable(currState);}if (isAccepting) printf(“accepted\n);else printf(“not accepted\n”); accepting state only used at end of input continued

  12. enum state nextState(enum state s, int ch){ if ((s == evenA) && (ch == ‘b’)) return evenA; if ((s == evenA) && (ch == ‘a’)) return oddA; if ((s == oddA) && (ch == ‘b’)) return oddA; if ((s == oddA) && (ch == ‘a’)) return evenA; printf(“Illegal Input”); exit(1);} simple handling of incorrect input continued

  13. int acceptable(enum state s){ if (s == oddA) return 1; // oddA is an accepting state return 0;}

  14. 3. The ‘aeiou’ Automaton • What English words contain the five vowels (a, e, i, o, u) in order? • Some words that match: • abstemious • facetious • sacrilegious

  15. 3.1. Automaton Graph L = all letters L - a L - e L - i L - o L - u a e i o u start 0 1 2 3 4 5

  16. 3.2. Execution Sequence (1) • InputMove to State f a c e t i o u s 0 f a c e t i o u s 0 1 f a c e t i o u s f a c e t i o u s 1 continued

  17. f a c e t i o u s 2 • InputMove to State f a c e t i o u s 2 f a c e t i o u s 3 f a c e t i o u s 4 the automaton can terminate here; no need to process more input f a c e t i o u s 5

  18. Execution Sequence (2) • InputMove to State a n d r e w 0 a n d r e w 1 a n d r e w 1 1 a n d r e w continued

  19. InputMove to State a n d r e w 1 a n d r e w 2 a n d r e w 2, and end of inputmeans failure

  20. 3.3. Translation to Code enum state {0, 1, 2, 3, 4, 5}; // poss. states enum state currState = 0; // start stateint isAccepting = 0; // falseint ch;while ((ch = getchar()) != EOF) && !isAccepting) { currState = nextState(currState, ch); isAccepting = acceptable(currState);}if (isAccepting) printf(“accepted\n);else printf(“not accepted\n”); stop processing when the accepting state is entered continued

  21. enum state nextState(enum state s, int ch){ if (s == 0) { if (ch == ‘a’) return 1; else return 0; // input is L-a } if (s == 1) { if (ch == ‘e’) return 2; else return 1; // input is L-e } if (s == 2) { if (ch == ‘i’) return 3; else return 2; // input is L-i } : continued

  22. : if (s == 3) { if (ch == ‘o’) return 4; else return 3; // input is L-o } if (s == 4) { if (ch == ‘u’) return 5; else return 4; // input is L-u } printf(“Illegal Input”); exit(1);} // end of nextState() simple handling of incorrect input

  23. int acceptable(enum state s){ if (s == 5) return 1; // 5 is an accepting state return 0;}

  24. 4. Generating Output • One possible extension to the basic automaton idea is to allow output: • when a transition is ‘triggered’ there can be optional output as well • Automata which generate output are sometimes called Finite State Machines (FSMs).

  25. 4.1. ‘even-odd’ with Output b • When the ‘a’ transition is triggered out of the evenA state, then a ‘1’ is output. b a/1 start evenA oddA a

  26. 4.2. Mathematical Coding • Add an ‘output’ mathematical function to the automaton representation: output( evenA, a ) => 1

  27. 4.3. Extending the C Coding • The while loop for ‘even-odd’ will become: :while ((ch = getchar()) != EOF)) {output(currState, ch); currState = nextState(currState, ch); isAccepting = acceptable(currState);} : continued

  28. The output() C function: void output(enum state s, int ch){ if ((s == evenA) && (ch == ‘a’)) putchar(‘1’);}

  29. 5. Deterministic and Nondeterministic Automata a • We have been writing deterministic automata so far: • for an input read by a state there is at most one transition that can be fired • state ‘s’ can process input ‘a’ and ‘w’, and fails for anything else S w

  30. Nondeterministic Automata V a • A nondeterministic (ND) automaton can have 2 or more transitions with the same label leaving a state. • Problem: if state S sees input ‘x’, then which transition should it use? x T S x U

  31. 5.1. The ‘man’ Automaton • Accept all strings that contain “man” • this is hard to write as a deterministic automaton. The following has bugs: L - m WRONG start m a n 0 1 2 3 L - a L - n continued

  32. The input string commandwill get stuck at state 0: 0 0 0 0 0 0 1 0 n m a d c o m the problem starts here

  33. 5.2. A ND Automaton Solution L • It is nondeterministic because an ‘m’ input in state 0 can be dealt with by two transitions: • a transition back to state 0, or • a transition to state 1 start m a n 0 1 2 3 continued

  34. Processing command input: 0 0 0 0 0 0 0 0 n a d c o m m 2 1 3 acceptingstate n a fail: reject the input 1 m

  35. 5.3. Executing a ND Automata • It is difficult to code ND automata in conventional languages, such as C. • Two different coding approaches: • 1. When an input arrives, execute all transitions in parallel. See which succeeds. • 2. When an input arrives,try one transition. If it leads to failure then backtrack and try another transition.

  36. 5.4. Why use ND Automata? • With nondeterminism, some problems are easier to solve/model. • Nondeterminism is common in some application areas, such as AI, graph search, and compilers. continued

  37. It is possible to translate a ND automaton into a (larger, complex) deterministic one. • In mathematical terms, ND automata and determinstic automata are equivalent • they can be used to model all the same problems

  38. 6. Regular Expressions (REs) • REs are an algebraic way of specifying how to recognise input • ‘algebraic’ means that the recognition pattern is defined using RE operands and operators • REs are equivalent to automata • REs and automata can be used on all the same problems

  39. 6.1. REs in grep • grep searches input lines, a line at a time. • If the line contains a string that matches grep's RE (pattern), then the line is output. output matching lines (e.g. to a file) input lines (e.g. from a file) grep "RE" hello andy my name is andy my bye byhe continued

  40. Examples grep "and" hello andy my name is andy my bye byhe hello andy my name is andy grep –E "an|my" hello andy my name is andy my bye byhe hello andy my name is andy my bye byhe "|" means "or" continued

  41. grep "hel*" hello andy my name is andy my bye byhe hello andy my bye byhe "*" means "0 or more"

  42. 6.2. Why use REs? • They are very useful for expressing patterns that recognise textual input. • For example, REs are used in: • editors • compilers • web-based search engines • communication protocols

  43. 6.3. The RE Language • A RE defines a pattern which recognises (matches) a set of strings • e.g. a RE can be defined that recognises the strings { aa, aba, abba, abbba, abbbba, …} • These recognisable strings are sometimes called the RE’s language.

  44. RE Operands • There are 4 basic kinds of operands: • characters (e.g. ‘a’, ‘1’, ‘(‘) • the symbol e (means an empty string ‘’) • the symbol {} (means the empty set) • variables, which can be assigned a RE • variable = RE

  45. RE Operators • There are three basic operators: • union ‘|’ • concatenation • closure *

  46. Concatenation • S T • this RE will use the S RE followed by the T RE to match against strings • What a string is matched by a RE"abc" • it is equivalent to: 'a' followed by 'b' followed by 'c'

  47. 6.4. REs for C Identifiers • We define two RE variables, letter and digit: letter = A | B | C | D ... Z | a | b | c | d .... z digit = 0 | 1 | 2 | ... 9 • ident is defined using letter and digit: ident = letter ( letter | digit )* continued

  48. Strings matched by ident include: ab345 w h5g • Strings not matched: 2 $abc ****

  49. 7. UNIX Regular Expressions • Different UNIX tools use slightly different extensions of the basic RE notation • vi, awk, sed, grep, egrep, etc. • Extra features include: • character classes • line start ‘^’ and end ‘$’ symbols • the wild card symbol ‘.’ • additional operators, R? and R+

  50. 7.1. Character Classes • The character class [a1 a2 ... an] stands for a1 | a2 | ... | an • a1- an stands for the set of characters between a1 and an • e.g. [A-Z] [a-z0-9]

More Related