Jumping Finite Automata
|
|
|
- Wilfrid Melton
- 5 years ago
- Views:
Transcription
1 Jumping Finite Automata Alexander Meduna and Petr Zemek Brno University of Technology, Faculty of Information Technology IT4Innovations Centre of Excellence Božetěchova 2, Brno, Czech Republic {meduna, izemek} Based on Alexander Meduna and Petr Zemek. Jumping Finite Automata. International Journal of Foundations of Computer Science (to appear in 2013). Supported by the IT4I Centre of Excellence CZ.1.05/1.1.00/
2 Contents Introduction Definitions and Examples Results Concluding Remarks and Discussion Jumping Finite Automata 2 / 21
3 Finite Automata a b s c f a a a c b b b b Jumping Finite Automata 3 / 21
4 Finite Automata a b s c f a a a c b b b b Jumping Finite Automata 3 / 21
5 Finite Automata a b s c f a a c b b b b Jumping Finite Automata 3 / 21
6 Finite Automata a b s c f a c b b b b Jumping Finite Automata 3 / 21
7 Finite Automata a b s c f c b b b b Jumping Finite Automata 3 / 21
8 Finite Automata a b s c f b b b b Jumping Finite Automata 3 / 21
9 Finite Automata a b s c f b b b Jumping Finite Automata 3 / 21
10 Finite Automata a b s c f b b Jumping Finite Automata 3 / 21
11 Finite Automata a b s c f b Jumping Finite Automata 3 / 21
12 Finite Automata a b s c f Accepted! Jumping Finite Automata 3 / 21
13 Finite Automata a b s c f Accepted language: { a } { c }{ b } Jumping Finite Automata 3 / 21
14 Jumping Finite Automata s a r c b t b b c a c a Jumping Finite Automata 4 / 21
15 Jumping Finite Automata s a r c b t b b c a c a Jumping Finite Automata 4 / 21
16 Jumping Finite Automata s a r c b t b b c c a Jumping Finite Automata 4 / 21
17 Jumping Finite Automata s a r c b t b c c a Jumping Finite Automata 4 / 21
18 Jumping Finite Automata s a r c b t b c a Jumping Finite Automata 4 / 21
19 Jumping Finite Automata s a r c b t b c Jumping Finite Automata 4 / 21
20 Jumping Finite Automata s a r c b t c Jumping Finite Automata 4 / 21
21 Jumping Finite Automata s a r c b t Accepted! Jumping Finite Automata 4 / 21
22 Jumping Finite Automata s a r c b t Accepted language: { w {a, b, c} : w a = w b = w c } Jumping Finite Automata 4 / 21
23 Definitions Definition A general jumping finite automaton (GJFA) is a quintuple M = ( Q, Σ, R, s, F ) where Q is a finite set of states; Σ is the input alphabet; R is a finite set of rules of the form s is the start state; F is a set of final states. py q (p, q Q, y Σ ) Jumping Finite Automata 5 / 21
24 Definitions Definition A general jumping finite automaton (GJFA) is a quintuple M = ( Q, Σ, R, s, F ) where Q is a finite set of states; Σ is the input alphabet; R is a finite set of rules of the form s is the start state; F is a set of final states. Definition py q (p, q Q, y Σ ) If all rules py q R satisfy y 1, then M is a jumping finite automaton (JFA). Jumping Finite Automata 5 / 21
25 Definitions Continued Definition If x, z, x, z, y Σ such that xz = x z and py q R, then M makes a jump from xpyz to x qz, symbolically written as xpyz x qz Jumping Finite Automata 6 / 21
26 Definitions Continued Definition If x, z, x, z, y Σ such that xz = x z and py q R, then M makes a jump from xpyz to x qz, symbolically written as xpyz x qz n intuitively, a sequence of n jumps (n 0); mathematically, the nth power of intuitively, a sequence of jumps (possibly empty); mathematically, the reflexive-transitive closure of Jumping Finite Automata 6 / 21
27 Definitions Continued Definition If x, z, x, z, y Σ such that xz = x z and py q R, then M makes a jump from xpyz to x qz, symbolically written as xpyz x qz n intuitively, a sequence of n jumps (n 0); mathematically, the nth power of intuitively, a sequence of jumps (possibly empty); mathematically, the reflexive-transitive closure of Definition The language accepted by M, denoted by L(M), is defined as L(M) = { uv : u, v Σ, usv f, f F } Jumping Finite Automata 6 / 21
28 Example #1 Example The JFA M = ( {s, r, t}, {a, b, c}, R, s, {s} ) with R = { sa r, rb t, tc s } accepts L(M) = { w {a, b, c} } : w a = w b = w c Jumping Finite Automata 7 / 21
29 Example #1 Example The JFA M = ( {s, r, t}, {a, b, c}, R, s, {s} ) with R = { sa r, rb t, tc s } accepts L(M) = { w {a, b, c} } : w a = w b = w c For instance: bacbcsa Jumping Finite Automata 7 / 21
30 Example #1 Example The JFA M = ( {s, r, t}, {a, b, c}, R, s, {s} ) with R = { sa r, rb t, tc s } accepts L(M) = { w {a, b, c} } : w a = w b = w c For instance: bacbcsa bacrbc [sa r] Jumping Finite Automata 7 / 21
31 Example #1 Example The JFA with accepts For instance: M = ( {s, r, t}, {a, b, c}, R, s, {s} ) R = { sa r, rb t, tc s } L(M) = { w {a, b, c} : w a = w b = w c } bacbcsa bacrbc [sa r] bactc [rb t] Jumping Finite Automata 7 / 21
32 Example #1 Example The JFA with accepts For instance: M = ( {s, r, t}, {a, b, c}, R, s, {s} ) R = { sa r, rb t, tc s } L(M) = { w {a, b, c} : w a = w b = w c } bacbcsa bacrbc [sa r] bactc [rb t] bsac [tc s] Jumping Finite Automata 7 / 21
33 Example #1 Example The JFA with accepts For instance: M = ( {s, r, t}, {a, b, c}, R, s, {s} ) R = { sa r, rb t, tc s } L(M) = { w {a, b, c} : w a = w b = w c } bacbcsa bacrbc [sa r] bactc [rb t] bsac [tc s] rbc [sa r] Jumping Finite Automata 7 / 21
34 Example #1 Example The JFA with accepts For instance: M = ( {s, r, t}, {a, b, c}, R, s, {s} ) R = { sa r, rb t, tc s } L(M) = { w {a, b, c} : w a = w b = w c } bacbcsa bacrbc [sa r] bactc [rb t] bsac [tc s] rbc [sa r] tc [rb t] Jumping Finite Automata 7 / 21
35 Example #1 Example The JFA with accepts For instance: M = ( {s, r, t}, {a, b, c}, R, s, {s} ) R = { sa r, rb t, tc s } L(M) = { w {a, b, c} : w a = w b = w c } bacbcsa bacrbc [sa r] bactc [rb t] bsac [tc s] rbc [sa r] tc [rb t] s [tc s] Jumping Finite Automata 7 / 21
36 Example #2 Example The GJFA with accepts H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } Jumping Finite Automata 8 / 21
37 Example #2 Example The GJFA with accepts For instance: H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } bbsbaa Jumping Finite Automata 8 / 21
38 Example #2 Example The GJFA with accepts For instance: H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } bbsbaa bbf a [sba f ] Jumping Finite Automata 8 / 21
39 Example #2 Example The GJFA with accepts For instance: H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } bbsbaa bbf a [sba f ] f bb [f a f ] Jumping Finite Automata 8 / 21
40 Example #2 Example The GJFA with accepts For instance: H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } bbsbaa bbf a [sba f ] f bb [f a f ] f b [f b f ] Jumping Finite Automata 8 / 21
41 Example #2 Example The GJFA with accepts For instance: H = ( {s, f }, {a, b}, R, s, {f } ), R = { sba f, f a f, f b f } L(H) = { a, b } { ba }{ a, b } bbsbaa bbf a [sba f ] f bb [f a f ] f b [f b f ] f [f b f ] Jumping Finite Automata 8 / 21
42 Power of GJFAs and JFAs Theorem Let K be an arbitrary language. Then, K is accepted by a JFA only if K = perm(k ). Jumping Finite Automata 9 / 21
43 Power of GJFAs and JFAs Theorem Let K be an arbitrary language. Then, K is accepted by a JFA only if K = perm(k ). Proof Idea When using pa q, a can appear on any position. Jumping Finite Automata 9 / 21
44 Power of GJFAs and JFAs Theorem Let K be an arbitrary language. Then, K is accepted by a JFA only if K = perm(k ). Proof Idea When using pa q, a can appear on any position. Corollary There is no JFA that accepts {a, b} {ba}{a, b}. Jumping Finite Automata 9 / 21
45 Power of GJFAs and JFAs Theorem Let K be an arbitrary language. Then, K is accepted by a JFA only if K = perm(k ). Proof Idea When using pa q, a can appear on any position. Corollary There is no JFA that accepts {a, b} {ba}{a, b}. Theorem GJFAs are strictly stronger than JFAs. Jumping Finite Automata 9 / 21
46 Power of GJFAs and JFAs Theorem Let K be an arbitrary language. Then, K is accepted by a JFA only if K = perm(k ). Proof Idea When using pa q, a can appear on any position. Corollary There is no JFA that accepts {a, b} {ba}{a, b}. Theorem GJFAs are strictly stronger than JFAs. Proof Idea The language {a, b} {ba}{a, b} is accepted by the GJFA from Example #2. Jumping Finite Automata 9 / 21
47 Relations Between Language Families Jumping Finite Automata 10 / 21
48 Relations Between Language Families {ab, ba} Jumping Finite Automata 10 / 21
49 Relations Between Language Families {ab, ba} {ab} Jumping Finite Automata 10 / 21
50 Relations Between Language Families {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
51 Relations Between Language Families {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
52 Relations Between Language Families {w : w a = w b = w c } {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
53 Relations Between Language Families {w : w a = w b = w c } {a, b} {ba}{a, b} {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
54 Relations Between Language Families {w : w a = w b = w c } {a, b} {ba}{a, b} {a} {b} {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
55 Relations Between Language Families {w : w a = w b = w c } {a n b n : n 0} {a, b} {ba}{a, b} {a} {b} {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
56 Relations Between Language Families {w : w a = w b = w c } {a n b n c n : n 0} {a n b n : n 0} {a, b} {ba}{a, b} {a} {b} {w : w a = w b } {a} {ab, ba} {ab} Jumping Finite Automata 10 / 21
57 Further Topics of Investigation By analogy with finite automata: removal of ε-moves (p q and qa r pa r) making JFAs deterministic Jumping Finite Automata 11 / 21
58 Further Topics of Investigation By analogy with finite automata: removal of ε-moves (p q and qa r pa r) making JFAs deterministic Theorem Every unary language accepted by a JFA is regular. Jumping Finite Automata 11 / 21
59 Further Topics of Investigation By analogy with finite automata: removal of ε-moves (p q and qa r pa r) making JFAs deterministic Theorem Every unary language accepted by a JFA is regular. Proof Idea In unary languages, it does not matter where the automaton jumps. Jumping Finite Automata 11 / 21
60 Further Topics of Investigation By analogy with finite automata: removal of ε-moves (p q and qa r pa r) making JFAs deterministic Theorem Every unary language accepted by a JFA is regular. Proof Idea In unary languages, it does not matter where the automaton jumps. Corollary The language of primes { a p : p is a prime number } cannot be accepted by any JFA. Jumping Finite Automata 11 / 21
61 Closure Properties Theorem JFA is closed under union. Jumping Finite Automata 12 / 21
62 Closure Properties Theorem JFA is closed under union. Proof We have: Two JFAs M 1 = (Q 1, Σ 1, R 1, s 1, F 1 ) M 2 = (Q 2, Σ 2, R 2, s 2, F 2 ) ( Q1 Q 2 = ) We need: JFA H = (Q, Σ, R, s, F) such that L(H) = L(M 1 ) L(M 2 ) Construction: Q = Q 1 Q 2 {s} Σ = Σ 1 Σ 2 R = R 1 R 2 {s s 1, s s 2 } F = F 1 F 2 ( s / Q1 Q 2 ) Jumping Finite Automata 12 / 21
63 Closure Properties Continued Theorem JFA is not closed under concatenation. Jumping Finite Automata 13 / 21
64 Closure Properties Continued Theorem JFA is not closed under concatenation. Proof Consider K 1 = {a} and K 2 = {b}. The JFA M 1 = ({s, f }, {a}, {sa f }, s, {f }) accepts K 1. The JFA M 2 = ({s, f }, {b}, {sb f }, s, {f }) accepts K 2. However, there is no JFA that accepts K 1 K 2 = {ab}. Jumping Finite Automata 13 / 21
65 Closure Properties Summary GJFA JFA union + + intersection + concatenation intersection with reg. lang. complement + shuffle? + mirror image? + Kleene star? Kleene plus? substitution regular substitution finite substitution + homomorphism + ε-free homomorphism + inverse homomorphism + + Jumping Finite Automata 14 / 21
66 Decidability Summary GJFA JFA membership + + emptiness + + finiteness + + infiniteness + + Jumping Finite Automata 15 / 21
67 An Infinite Hierarchy of Language Families Definition A GJFA M = (Q, Σ, R, s, F) is of degree n, where n 0, if py q R implies that y n. Jumping Finite Automata 16 / 21
68 An Infinite Hierarchy of Language Families Definition A GJFA M = (Q, Σ, R, s, F) is of degree n, where n 0, if py q R implies that y n. Example The GJFA M = ({s, p, f }, {a, b, c}, R, s, {f }) with R = { sabc p, pcc f, f a f } is of degree 3. Jumping Finite Automata 16 / 21
69 An Infinite Hierarchy of Language Families Definition A GJFA M = (Q, Σ, R, s, F) is of degree n, where n 0, if py q R implies that y n. Example The GJFA M = ({s, p, f }, {a, b, c}, R, s, {f }) with R = { sabc p, pcc f, f a f } is of degree 3. GJFA n the family of languages accepted by GJFAs of degree n Jumping Finite Automata 16 / 21
70 An Infinite Hierarchy of Language Families Definition A GJFA M = (Q, Σ, R, s, F) is of degree n, where n 0, if py q R implies that y n. Example The GJFA M = ({s, p, f }, {a, b, c}, R, s, {f }) with R = { sabc p, pcc f, f a f } is of degree 3. GJFA n the family of languages accepted by GJFAs of degree n Theorem GJFA n GJFA n+1 for all n 0 Jumping Finite Automata 16 / 21
71 Left and Right Jumps Definition A GJFA makes a left jump from wxpyz to wqxz by py q: wxpyz l wqxz where w, x, y, z Σ. Jumping Finite Automata 17 / 21
72 Left and Right Jumps Definition A GJFA makes a left jump from wxpyz to wqxz by py q: wxpyz l wqxz where w, x, y, z Σ. Definition A GJFA makes a right jump from wpyxz to wxqz by py q: wpyxz r wxqz where w, x, y, z Σ. Jumping Finite Automata 17 / 21
73 Left and Right Jumps Definition A GJFA makes a left jump from wxpyz to wqxz by py q: wxpyz l wqxz where w, x, y, z Σ. Definition A GJFA makes a right jump from wpyxz to wxqz by py q: wpyxz r wxqz where w, x, y, z Σ. l GJFA l JFA r GJFA r JFA GJFAs using only left jumps JFAs using only left jumps GJFAs using only right jumps JFAs using only right jumps Jumping Finite Automata 17 / 21
74 Left and Right Jumps Results Theorem rgjfa = r JFA = REG Jumping Finite Automata 18 / 21
75 Left and Right Jumps Results Theorem rgjfa = r JFA = REG Proof Idea r JFA = REG r GJFA = REG simulating a finite automaton simulating a general finite automaton Jumping Finite Automata 18 / 21
76 Left and Right Jumps Results Theorem rgjfa = r JFA = REG Proof Idea r JFA = REG r GJFA = REG simulating a finite automaton simulating a general finite automaton Theorem ljfa REG Jumping Finite Automata 18 / 21
77 Left and Right Jumps Results Theorem rgjfa = r JFA = REG Proof Idea r JFA = REG r GJFA = REG simulating a finite automaton simulating a general finite automaton Theorem ljfa REG Proof Idea with accepts M = ( {s, p, q}, {a, b}, R, s, {s} ) R = { sa p, pb s, sb q, qa s } l L(M) = { w : w a = w b } Jumping Finite Automata 18 / 21
78 A Variety of Start Configurations Definition Let M = (Q, Σ, R, s, F) be a GJFA. Set b L(M) = {w Σ : sw f with f F} (beginning) a L(M) = {uv : u, v Σ, usv f with f F} (anywhere) e L(M) = {w Σ : ws f with f F} (end) Jumping Finite Automata 19 / 21
79 A Variety of Start Configurations Definition Let M = (Q, Σ, R, s, F) be a GJFA. Set b L(M) = {w Σ : sw f with f F} (beginning) a L(M) = {uv : u, v Σ, usv f with f F} (anywhere) e L(M) = {w Σ : ws f with f F} (end) b GJFA a GJFA e GJFA b JFA a JFA e JFA GJFAs starting at the beginning GJFAs starting anywhere GJFAs starting at the end JFAs starting at the beginning JFAs starting anywhere JFAs starting at the end Jumping Finite Automata 19 / 21
80 A Variety of Start Configurations Definition Let M = (Q, Σ, R, s, F) be a GJFA. Set b L(M) = {w Σ : sw f with f F} (beginning) a L(M) = {uv : u, v Σ, usv f with f F} (anywhere) e L(M) = {w Σ : ws f with f F} (end) b GJFA a GJFA e GJFA b JFA a JFA e JFA GJFAs starting at the beginning GJFAs starting anywhere GJFAs starting at the end JFAs starting at the beginning JFAs starting anywhere JFAs starting at the end Observations: a L(M) = L(M) a GJFA = GJFA and a JFA = JFA Jumping Finite Automata 19 / 21
81 A Variety of Start Configurations Results Theorem a JFA b JFA Jumping Finite Automata 20 / 21
82 A Variety of Start Configurations Results Theorem a JFA b JFA Proof Idea The JFA M = ( {s, f }, {a, b}, {sa f, f b f }, s, {f } ) satisfies b L(M) = {a}{b} ({a}{b} / a JFA). Jumping Finite Automata 20 / 21
83 A Variety of Start Configurations Results Theorem a JFA b JFA Proof Idea The JFA M = ( {s, f }, {a, b}, {sa f, f b f }, s, {f } ) satisfies b L(M) = {a}{b} ({a}{b} / a JFA). Theorem a GJFA b GJFA Jumping Finite Automata 20 / 21
84 A Variety of Start Configurations Results Theorem a JFA b JFA Proof Idea The JFA M = ( {s, f }, {a, b}, {sa f, f b f }, s, {f } ) satisfies b L(M) = {a}{b} ({a}{b} / a JFA). Theorem a GJFA b GJFA Theorem e GJFA = a GJFA and e JFA = a JFA Jumping Finite Automata 20 / 21
85 Conclusion and Open Problem Areas closure properties of GJFA (shuffle, Kleene star, Kleene plus, and mirror image) other decision problems of GJFA and JFA, like equivalence, universality, inclusion, or regularity the effect of left jumps to the power of JFAs and GJFAs (we only know that l JFA REG ) strict determinism applications: verification of a relation concerning the number of symbol occurrences (genetics) Jumping Finite Automata 21 / 21
86 Discussion
CS 455/555: Finite automata
CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently
Properties of Context-Free Languages. Closure Properties Decision Properties
Properties of Context-Free Languages Closure Properties Decision Properties 1 Closure Properties of CFL s CFL s are closed under union, concatenation, and Kleene closure. Also, under reversal, homomorphisms
Sri vidya college of engineering and technology
Unit I FINITE AUTOMATA 1. Define hypothesis. The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order
HKN CS/ECE 374 Midterm 1 Review. Nathan Bleier and Mahir Morshed
HKN CS/ECE 374 Midterm 1 Review Nathan Bleier and Mahir Morshed For the most part, all about strings! String induction (to some extent) Regular languages Regular expressions (regexps) Deterministic finite
The Pumping Lemma and Closure Properties
The Pumping Lemma and Closure Properties Mridul Aanjaneya Stanford University July 5, 2012 Mridul Aanjaneya Automata Theory 1/ 27 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),
Closure Properties of Regular Languages. Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism
Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Properties Recall a closure property is a statement
Lecture 3: Nondeterministic Finite Automata
Lecture 3: Nondeterministic Finite Automata September 5, 206 CS 00 Theory of Computation As a recap of last lecture, recall that a deterministic finite automaton (DFA) consists of (Q, Σ, δ, q 0, F ) where
Equivalence of DFAs and NFAs
CS 172: Computability and Complexity Equivalence of DFAs and NFAs It s a tie! DFA NFA Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: L.von Ahn, L. Blum, M. Blum What we ll do today Prove that DFAs
Sequences, Relations, and Functions
Sequences, Relations, and Functions Alexander Meduna, Lukáš Vrábel, and Petr Zemek Brno University of Technology, Faculty of Information Technology Božetěchova 1/2, 612 00 Brno, CZ http://www.fit.vutbr.cz/
Closure Properties of Regular Languages
Closure Properties of Regular Languages Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Sep 21, 2016 Robb T. Koether (Hampden-Sydney College) Closure Properties of Regular Languages
Great Theoretical Ideas in Computer Science. Lecture 4: Deterministic Finite Automaton (DFA), Part 2
5-25 Great Theoretical Ideas in Computer Science Lecture 4: Deterministic Finite Automaton (DFA), Part 2 January 26th, 27 Formal definition: DFA A deterministic finite automaton (DFA) M =(Q,,,q,F) M is
R e s e a r c h R e p o r t. Properties of Right One-Way Jumping Finite Automata. IFIG Research Report 1802 March Institut für Informatik
I F I G R e s e a r c h R e p o r t Institut für Informatik Properties of Right One-Way Jumping Finite Automata Simon Beier Markus Holzer IFIG Research Report 1802 March 2018 Institut für Informatik JLU
Finite Automata and Regular languages
Finite Automata and Regular languages Huan Long Shanghai Jiao Tong University Acknowledgements Part of the slides comes from a similar course in Fudan University given by Prof. Yijia Chen. http://basics.sjtu.edu.cn/
TWO-DIMENSIONAL JUMPING FINITE AUTOMATA. 1. Introduction
Math Appl 5 (2016), 105 122 DOI: 1013164/ma201608 TWO-DIMENSIONAL JUMPING FINITE AUTOMATA S JAMES IMMANUEL and D G THOMAS Abstract In this paper, we extend a newly introduced concept called the jumping
UNIT-II. NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: SIGNIFICANCE. Use of ε-transitions. s t a r t. ε r. e g u l a r
Syllabus R9 Regulation UNIT-II NONDETERMINISTIC FINITE AUTOMATA WITH ε TRANSITIONS: In the automata theory, a nondeterministic finite automaton (NFA) or nondeterministic finite state machine is a finite
A Reduction of Finitely Expandable Deep Pushdown Automata
http://excel.fit.vutbr.cz A Reduction of Finitely Expandable Deep Pushdown Automata Lucie Dvořáková Abstract For a positive integer n, n-expandable deep pushdown automata always contain no more than n
CS 121, Section 2. Week of September 16, 2013
CS 121, Section 2 Week of September 16, 2013 1 Concept Review 1.1 Overview In the past weeks, we have examined the finite automaton, a simple computational model with limited memory. We proved that DFAs,
1 Alphabets and Languages
1 Alphabets and Languages Look at handout 1 (inference rules for sets) and use the rules on some examples like {a} {{a}} {a} {a, b}, {a} {{a}}, {a} {{a}}, {a} {a, b}, a {{a}}, a {a, b}, a {{a}}, a {a,
TAFL 1 (ECS-403) Unit- II. 2.1 Regular Expression: The Operators of Regular Expressions: Building Regular Expressions
TAFL 1 (ECS-403) Unit- II 2.1 Regular Expression: 2.1.1 The Operators of Regular Expressions: 2.1.2 Building Regular Expressions 2.1.3 Precedence of Regular-Expression Operators 2.1.4 Algebraic laws for
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY NON-DETERMINISM and REGULAR OPERATIONS THURSDAY JAN 6 UNION THEOREM The union of two regular languages is also a regular language Regular Languages Are
3515ICT: Theory of Computation. Regular languages
3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,
DM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
Harvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs
Harvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs Harry Lewis October 8, 2013 Reading: Sipser, pp. 119-128. Pushdown Automata (review) Pushdown Automata = Finite automaton
Before we show how languages can be proven not regular, first, how would we show a language is regular?
CS35 Proving Languages not to be Regular Before we show how languages can be proven not regular, first, how would we show a language is regular? Although regular languages and automata are quite powerful
Properties of Context-Free Languages
Properties of Context-Free Languages Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr
Obtaining the syntactic monoid via duality
Radboud University Nijmegen MLNL Groningen May 19th, 2011 Formal languages An alphabet is a non-empty finite set of symbols. If Σ is an alphabet, then Σ denotes the set of all words over Σ. The set Σ forms
Introduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures and Instructions 23.10. 3.11. 17.11. 24.11. 1.12. 11.12.
Uses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
Miscellaneous. Closure Properties Decision Properties
Miscellaneous Closure Properties Decision Properties 1 Closure Properties of CFL s CFL s are closed under union, concatenation, and Kleene closure. Also, under reversal, homomorphisms and inverse homomorphisms.
CS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
Automata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
CS 154. Finite Automata, Nondeterminism, Regular Expressions
CS 54 Finite Automata, Nondeterminism, Regular Expressions Read string left to right The DFA accepts a string if the process ends in a double circle A DFA is a 5-tuple M = (Q, Σ, δ, q, F) Q is the set
Mathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
Context Free Language Properties
Context Free Language Properties Knowing that the context free languages are exactly those sets accepted by nondeterministic pushdown automata provides us a bit of information about them. We know that
Introduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
arxiv: v2 [cs.fl] 29 Nov 2013
![arxiv: v2 [cs.fl] 29 Nov 2013](/thumbs/78/78264249.jpg "arxiv: v2 [cs.fl] 29 Nov 2013")
A Survey of Multi-Tape Automata Carlo A. Furia May 2012 arxiv:1205.0178v2 [cs.fl] 29 Nov 2013 Abstract This paper summarizes the fundamental expressiveness, closure, and decidability properties of various
Lower and Upper Bound Results for Hard Problems Related to Finite Automata
Lower and Upper Bound Results for Hard Problems Related to Finite Automata Henning Fernau Universität Trier, Germany fernau@informatik.uni-trier.de Andreas Krebs Universität Tübingen, Germany krebs@informatik.uni-tuebingen.de
Theory of Computation
Fall 2002 (YEN) Theory of Computation Midterm Exam. Name:... I.D.#:... 1. (30 pts) True or false (mark O for true ; X for false ). (Score=Max{0, Right- 1 2 Wrong}.) (1) X... If L 1 is regular and L 2 L
CSci 311, Models of Computation Chapter 4 Properties of Regular Languages
CSci 311, Models of Computation Chapter 4 Properties of Regular Languages H. Conrad Cunningham 29 December 2015 Contents Introduction................................. 1 4.1 Closure Properties of Regular
Characterization and Complexity Results on Jumping Finite Automata
Characterization and Complexity Results on Jumping Finite Automata Henning Fernau a,, Meenakshi Paramasivan a, Markus L. Schmid a, Vojtěch Vorel b a Fachbereich 4 Abteilung Informatik, Universität Trier,
CS 154, Lecture 3: DFA NFA, Regular Expressions
CS 154, Lecture 3: DFA NFA, Regular Expressions Homework 1 is coming out Deterministic Finite Automata Computation with finite memory Non-Deterministic Finite Automata Computation with finite memory and
Nondeterministic Finite Automata
Nondeterministic Finite Automata Not A DFA Does not have exactly one transition from every state on every symbol: Two transitions from q 0 on a No transition from q 1 (on either a or b) Though not a DFA,
Lecture 7 Properties of regular languages
Lecture 7 Properties of regular languages COT 4420 Theory of Computation Section 4.1 Closure properties of regular languages If L 1 and L 2 are regular languages, then we prove that: Union: L 1 L 2 Concatenation:
GEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I
GEETANJALI INSTITUTE OF TECHNICAL STUDIES, UDAIPUR I Internal Examination 2017-18 B.Tech III Year VI Semester Sub: Theory of Computation (6CS3A) Time: 1 Hour 30 min. Max Marks: 40 Note: Attempt all three
Theory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 14: Applications of PCP Goal of this Lecture Our goal is to present some typical undecidability
Büchi Automata and their closure properties. - Ajith S and Ankit Kumar
Büchi Automata and their closure properties - Ajith S and Ankit Kumar Motivation Conventional programs accept input, compute, output result, then terminate Reactive program : not expected to terminate
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
Chapter Five: Nondeterministic Finite Automata
Chapter Five: Nondeterministic Finite Automata From DFA to NFA A DFA has exactly one transition from every state on every symbol in the alphabet. By relaxing this requirement we get a related but more
MA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
Finite Automata and Languages
CS62, IIT BOMBAY Finite Automata and Languages Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS62: New Trends in IT: Modeling and Verification of Cyber-Physical Systems (2
CS 455/555: Mathematical preliminaries
CS 455/555: Mathematical preliminaries Stefan D. Bruda Winter 2019 SETS AND RELATIONS Sets: Operations: intersection, union, difference, Cartesian product Big, powerset (2 A ) Partition (π 2 A, π, i j
Regular Expressions and Language Properties
Regular Expressions and Language Properties Mridul Aanjaneya Stanford University July 3, 2012 Mridul Aanjaneya Automata Theory 1/ 47 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),
Closure under the Regular Operations
September 7, 2013 Application of NFA Now we use the NFA to show that collection of regular languages is closed under regular operations union, concatenation, and star Earlier we have shown this closure
Topics in Timed Automata
1/32 Topics in Timed Automata B. Srivathsan RWTH-Aachen Software modeling and Verification group 2/32 Timed Automata A theory of timed automata R. Alur and D. Dill, TCS 94 2/32 Timed Automata Language
Pushdown automata. Twan van Laarhoven. Institute for Computing and Information Sciences Intelligent Systems Radboud University Nijmegen
Pushdown automata Twan van Laarhoven Institute for Computing and Information Sciences Intelligent Systems Version: fall 2014 T. van Laarhoven Version: fall 2014 Formal Languages, Grammars and Automata
Computability and Complexity
Computability and Complexity Push-Down Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
Properties of Context-free Languages. Reading: Chapter 7
Properties of Context-free Languages Reading: Chapter 7 1 Topics 1) Simplifying CFGs, Normal forms 2) Pumping lemma for CFLs 3) Closure and decision properties of CFLs 2 How to simplify CFGs? 3 Three ways
Finite Automata and Regular Languages
Finite Automata and Regular Languages Topics to be covered in Chapters 1-4 include: deterministic vs. nondeterministic FA, regular expressions, one-way vs. two-way FA, minimization, pumping lemma for regular
Computational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
Theory of Computation (I) Yijia Chen Fudan University
Theory of Computation (I) Yijia Chen Fudan University Instructor Yijia Chen Homepage: http://basics.sjtu.edu.cn/~chen Email: yijiachen@fudan.edu.cn Textbook Introduction to the Theory of Computation Michael
Reversal of Regular Languages and State Complexity
Reversal of Regular Languages and State Complexity Juraj Šebej Institute of Computer Science, Faculty of Science, P. J. Šafárik University, Jesenná 5, 04001 Košice, Slovakia juraj.sebej@gmail.com Abstract.
Regular expressions. Regular expressions. Regular expressions. Regular expressions. Remark (FAs with initial set recognize the regular languages)
Definition (Finite automata with set of initial states) A finite automata with set of initial states, or FA with initial set for short, is a 5-tupel (Q, Σ, δ, S, F ) where Q, Σ, δ, and F are defined as
Inf2A: Converting from NFAs to DFAs and Closure Properties
1/43 Inf2A: Converting from NFAs to DFAs and Stuart Anderson School of Informatics University of Edinburgh October 13, 2009 Starter Questions 2/43 1 Can you devise a way of testing for any FSM M whether
Hierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
Formal Languages, Automata and Models of Computation
CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 5 School of Innovation, Design and Engineering Mälardalen University 2011 1 Content - More Properties of Regular Languages (RL)
Probabilistic Aspects of Computer Science: Probabilistic Automata
Probabilistic Aspects of Computer Science: Probabilistic Automata Serge Haddad LSV, ENS Paris-Saclay & CNRS & Inria M Jacques Herbrand Presentation 2 Properties of Stochastic Languages 3 Decidability Results
Non-emptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
Closure Properties of Context-Free Languages. Foundations of Computer Science Theory
Closure Properties of Context-Free Languages Foundations of Computer Science Theory Closure Properties of CFLs CFLs are closed under: Union Concatenation Kleene closure Reversal CFLs are not closed under
Special Factors and Suffix and Factor Automata
Special Factors and Suffix and Factor Automata LIAFA, Paris 5 November 2010 Finite Words Let Σ be a finite alphabet, e.g. Σ = {a, n, b, c}. A word over Σ is finite concatenation of symbols of Σ, that is,
Finite State Automata
Trento 2005 p. 1/4 Finite State Automata Automata: Theory and Practice Paritosh K. Pandya (TIFR, Mumbai, India) Unversity of Trento 10-24 May 2005 Trento 2005 p. 2/4 Finite Word Langauges Alphabet Σ is
Regular expressions and Kleene s theorem
and Informatics 2A: Lecture 5 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 25 September, 2014 1 / 26 1 More closure properties of regular languages Operations on languages
Properties of Regular Languages. BBM Automata Theory and Formal Languages 1
Properties of Regular Languages BBM 401 - Automata Theory and Formal Languages 1 Properties of Regular Languages Pumping Lemma: Every regular language satisfies the pumping lemma. A non-regular language
Chapter 3. Regular grammars
Chapter 3 Regular grammars 59 3.1 Introduction Other view of the concept of language: not the formalization of the notion of effective procedure, but set of words satisfying a given set of rules Origin
Fooling Sets and. Lecture 5
Fooling Sets and Introduction to Nondeterministic Finite Automata Lecture 5 Proving that a language is not regular Given a language, we saw how to prove it is regular (union, intersection, concatenation,
INF Introduction and Regular Languages. Daniel Lupp. 18th January University of Oslo. Department of Informatics. Universitetet i Oslo
INF28 1. Introduction and Regular Languages Daniel Lupp Universitetet i Oslo 18th January 218 Department of Informatics University of Oslo INF28 Lecture :: 18th January 1 / 33 Details on the Course consists
Tree Automata and Rewriting
and Rewriting Ralf Treinen Université Paris Diderot UFR Informatique Laboratoire Preuves, Programmes et Systèmes treinen@pps.jussieu.fr July 23, 2010 What are? Definition Tree Automaton A tree automaton
languages by semifilter-congruences
ideas Suffix semifilter-congruences Southwest Univ. Southwest Univ. Hongkong Univ. July 5 9, 2010, Nankai, China. Prefixsuffix Contents ideas 1 2 ideas 3 Suffix- 4 Prefix-suffix- Suffix Prefixsuffix ideas
COM364 Automata Theory Lecture Note 2 - Nondeterminism
COM364 Automata Theory Lecture Note 2 - Nondeterminism Kurtuluş Küllü March 2018 The FA we saw until now were deterministic FA (DFA) in the sense that for each state and input symbol there was exactly
Foundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2 Prepared by, Dr. Subhendu Kumar Rath, BPUT, Odisha. UNIT 2 Structure NON-DETERMINISTIC FINITE AUTOMATA
Properties of Regular Languages (2015/10/15)
Chapter 4 Properties of Regular Languages (25//5) Pasbag, Turkey Outline 4. Proving Languages Not to e Regular 4.2 Closure Properties of Regular Languages 4.3 Decision Properties of Regular Languages 4.4
Finite Automata Part Two
Finite Automata Part Two DFAs A DFA is a Deterministic Finite Automaton A DFA is defined relative to some alphabet Σ. For each state in the DFA, there must be exactly one transition defined for each symbol
Languages. A language is a set of strings. String: A sequence of letters. Examples: cat, dog, house, Defined over an alphabet:
Languages 1 Languages A language is a set of strings String: A sequence of letters Examples: cat, dog, house, Defined over an alphaet: a,, c,, z 2 Alphaets and Strings We will use small alphaets: Strings
The View Over The Horizon
The View Over The Horizon enumerable decidable context free regular Context-Free Grammars An example of a context free grammar, G 1 : A 0A1 A B B # Terminology: Each line is a substitution rule or production.
On closures of lexicographic star-free languages. E. Ochmański and K. Stawikowska
On closures of lexicographic star-free languages E. Ochmański and K. Stawikowska Preprint No 7/2005 Version 1, posted on April 19, 2005 On closures of lexicographic star-free languages Edward Ochma ski
CSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105-ab/ Today's learning goals Sipser Section 1.1 Design an automaton that recognizes a given language. Specify each of
CS243, Logic and Computation Nondeterministic finite automata
CS243, Prof. Alvarez NONDETERMINISTIC FINITE AUTOMATA (NFA) Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (67) 552-4333
Automata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
Functions on languages:
MA/CSSE 474 Final Exam Notation and Formulas page Name (turn this in with your exam) Unless specified otherwise, r,s,t,u,v,w,x,y,z are strings over alphabet Σ; while a, b, c, d are individual alphabet
Blackhole Pushdown Automata
Fundamenta Informaticae XXI (2001) 1001 1020 1001 IOS Press Blackhole Pushdown Automata Erzsébet Csuhaj-Varjú Computer and Automation Research Institute, Hungarian Academy of Sciences Kende u. 13 17, 1111
C6.2 Push-Down Automata
Theory of Computer Science April 5, 2017 C6. Context-free Languages: Push-down Automata Theory of Computer Science C6. Context-free Languages: Push-down Automata Malte Helmert University of Basel April
More About Turing Machines. Programming Tricks Restrictions Extensions Closure Properties
More About Turing Machines Programming Tricks Restrictions Extensions Closure Properties 1 Overview At first, the TM doesn t look very powerful. Can it really do anything a computer can? We ll discuss
Theory of Computation 4 Non-Deterministic Finite Automata
Theory of Computation 4 Non-Deterministic Finite Automata Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Theory of Computation
Axioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
Chapter 2: Finite Automata
Chapter 2: Finite Automata 2.1 States, State Diagrams, and Transitions Finite automaton is the simplest acceptor or recognizer for language specification. It is also the simplest model of a computer. A
Computational Models - Lecture 3 1
Computational Models - Lecture 3 1 Handout Mode Iftach Haitner and Yishay Mansour. Tel Aviv University. March 13/18, 2013 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
Regular Expressions. Definitions Equivalence to Finite Automata
Regular Expressions Definitions Equivalence to Finite Automata 1 RE s: Introduction Regular expressions are an algebraic way to describe languages. They describe exactly the regular languages. If E is
Context-Free Grammars (and Languages) Lecture 7
Context-Free Grammars (and Languages) Lecture 7 1 Today Beyond regular expressions: Context-Free Grammars (CFGs) What is a CFG? What is the language associated with a CFG? Creating CFGs. Reasoning about
On the Accepting Power of 2-Tape Büchi Automata
On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata