State Complexity of Union and Intersection of Binary Suffix-Free Languages
|
|
- Kenneth Sanders
- 6 years ago
- Views:
Transcription
1 Stte Complexity of Union nd Intersetion of Binry Suffix-Free Lnguges Glin Jirásková nd Pvol Olejár Slovk Ademy of Sienes nd Šfárik University, Košie Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
2 Outline DFAs nd NFAs Miniml Automt Suffix Free Lnguges Desriptionl Complexity of Intersetion nd Union Summry nd Open Prolems Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
3 Deterministi nd Nondeterministi Finite Automt Exmple (DFA A = (Q,Σ,δ,s,F)) A Q = {0,1,2} Σ = {,} δ : Q Σ Q s = 0 F = {0,2} (omplete) L(A) = {w {,} the numer of s in w is even} Exmple (NFA M 3 = (Q,Σ,δ,s,F)) M 3, 0 Q = {0,1,2,3} Σ = {,} δ : Q Σ 2 Q s = 0, 1 2, F = {3} (ε-free, single initil stte) L 3 = {w {,} w ontins n in the third position from the end} 3 Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
4 Miniml Deterministi Finite Automt Automt A nd B re equivlent if L(A) = L(B). A df A is miniml if every equivlent df hs t lest s mny sttes s A. Exmple A L(A) = {w {,} # (w) is even} B L(A) = L(B) 3, Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
5 Miniml Deterministi Finite Automt Automt A nd B re equivlent if L(A) = L(B). A df A is miniml if every equivlent df hs t lest s mny sttes s A. Exmple A L(A) = {w {,} # (w) is even} B L(A) = L(B) 3, Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
6 Miniml Deterministi Finite Automt Automt A nd B re equivlent if L(A) = L(B). A df A is miniml if every equivlent df hs t lest s mny sttes s A. Exmple A L(A) = {w {,} # (w) is even} Theorem A df is miniml if (1) eh stte is rehle, (2) no two sttes re equivlent. 0 1 The miniml df epting L(A). Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
7 Miniml Deterministi Finite Automt Automt A nd B re equivlent if L(A) = L(B). A df A is miniml if every equivlent df hs t lest s mny sttes s A. Exmple A L(A) = {w {,} # (w) is even} The stte omplexity of L is the numer of sttes in the miniml DFA for L. 0 1 The stte omplexity of L(A) is 2. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
8 Fooling-Set Lower-Bound Method A set of pirs of strings {(x 1,y 1 ),(x 2,y 2 ),...,(x n,y n )} is fooling set for L, if (F1) x i y i L for ll i, (F2) if i j, then x i y j / L or x j y i / L. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
9 Fooling-Set Lower-Bound Method A set of pirs of strings {(x 1,y 1 ),(x 2,y 2 ),...,(x n,y n )} is fooling set for L, if (F1) x i y i L for ll i, (F2) if i j, then x i y j / L or x j y i / L. Exmple Σ = {,,m,n} L = n(m+) A = {( ε,nm), ( n, m ), ( n, m )} is fooling set for L. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
10 Fooling-Set Lower-Bound Method A set of pirs of strings {(x 1,y 1 ),(x 2,y 2 ),...,(x n,y n )} is fooling set for L, if (F1) x i y i L for ll i, (F2) if i j, then x i y j / L or x j y i / L. Lemm (Aho 83, Birget 92) If A is fooling set for L, then every NFA epting L hs t lest A sttes. Exmple Σ = {,,m,n} L = n(m+) A = {( ε,nm), ( n, m ), ( n, m )} is fooling set for L. The nondeterministi stte omplexity of L is 3. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
11 Cross-Produt Automton for Intersetion nd Union Given DFAs A = (Q A,Σ,δ A,s A,F A ) B = (Q B,Σ,δ B,s B,F B ) their ross-produt utomton is (Q,Σ,δ,s,F) with Q = Q A Q B δ((p,q),) = (δ A (p,),δ B (q,)) s = (s A,s B ) F = F A F B for intersetion F = (F A Q B ) (Q A F B ) for union Exmple (Σ = {,,m,n}) A B n m q, 1 q 2 q 3 q 4 m,n L(A) L(B) = { nm } ded p 1 q 2 p 1 q 3 p 1 q 4 p 1 d p 2 q 1 p 2 q 2 p 2 q 3 p 2 q 4 p 2 d m,m p p 3 p 3 q 3 q q m 1 3 p 3 q,m 2 4 p 3 d m,n d q 1 m,,,m,n p n n, 1 p 2 p 3 ded,,m,n p q 1 1 n m q q q, d 2 d 3 d 4 d d m,n,,m,n Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
12 Cross-Produt Automton for Intersetion nd Union Given DFAs A = (Q A,Σ,δ A,s A,F A ) B = (Q B,Σ,δ B,s B,F B ) their ross-produt utomton is (Q,Σ,δ,s,F) with Q = Q A Q B δ((p,q),) = (δ A (p,),δ B (q,)) s = (s A,s B ) F = F A F B for intersetion F = (F A Q B ) (Q A F B ) for union Exmple (Σ = {,,m,n}) A B L(A) n m q, 1 q 2 q 3 q 4 m,n ded = n(m+)* n*m p 1 q 2 p 1 q 3 p 1 q 4 p 1 d p 2 q 1 p 2 q 2 p 2 q 3 p 2 q 4 p 2 d m,m p 3 q 1 p 3 q m 2 p 3 q 3 p 3 q,m 4 p 3 d m,n d q 1 m,,,m,n p n n, 1 p 2 p 3 ded,,m,n p q 1 1 n L(B) m q 2 q, d d 3 d q 4 d d m,n,,m,n Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
13 Outline Suffix Free Lnguges Desriptionl Complexity of Intersetion nd Union Summry nd Open Prolems Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
14 Suffix-Free Regulr Lnguges A regulr lnguge L is suffix-free if there re no two different strings u nd v in L suh tht u= wv. Exmple m,,,m,n n n, A p 1 p 2 p 3 ded,,m,n L(A) = n(m+)* B n m q, 1 q 2 q 3 q 4 m,n ded L(B) = n*m Theorem (Hn, Slom 2008) In the miniml (omplete) DFA for suffix free lnguge, there is ded stte; no trnsition goes to the initil stte. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
15 Stte Complexity of Opertions on Suffix-Free Lnguges (Hn, Slom 2008) Opertion Suffix-Free Σ Regulr Σ L 2 n n n 2 2 L R 2 n n 2 K L (m 1)2 n (m 1)2 n + 2 n 1 2 K L mn 2(m + n) mn 2 K L mn (m + n) mn 2 Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
16 Binry Worst-Cse Exmples Exmple (Str, Mslov 1970) n 1 n 2 n n 2 Exmple (Reversl, Leiss 1981) n 1 n 2 n Exmple (Contention) m 1 m n 1 n (m 1)2 n + 2 n 1 Exmple (Union, Mslov 1970) m 1 m n 1 n mn Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
17 Stte Complexity of Opertions on Suffix-Free Lnguges Opertion Suffix-Free Σ Regulr Σ L 2 n n n 2 2 L R 2 n n 2 K L (m 1)2 n (m 1)2 n + 2 n 1 2 K L mn 2(m + n) mn 2 K L mn (m + n) mn 2 A B m,,,m,n p n n, 1 p 2 p 3 ded,,m,n n m q, 1 q 2 q 3 q 4 m,n Upper ounds on ded L(A) L(B) nd L(A) L(B) p q p 1 q 2 p 1 q 3 p 1 q p 1 d n p 2 q 1 p 2 q 2 p 2 q 3 p 2 q 4 p 2 d m,m p p 3 p 3 q 3 q q m p 3 q,m 4 p 3 d m,n m d q q q q, 1 d 2 d 3 d 4 d d m,n,,m,n Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
18 Our Results on Binry Suffix-Free Regulr Lnguges Theorem (Stte omplexity of intersetion) The upper ound mn 2(m + n) + 6 on the stte omplexity of intersetion of suffix-free lnguges is tight in the inry se. Theorem (Stte omplexity of union) The upper ound mn (m + n) + 2 on the stte omplexity of union of suffix-free lnguges is tight in the inry se. Proof. Witness lnguges for oth opertions:, m 1 m 1 2, 3, 4,,... n 1 n, Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
19 Our Results on Binry Suffix-Free Regulr Lnguges II Theorem (Nondeterministi stte omplexity of intersetion) The nondeterministi stte omplexity of intersetion of inry suffix-free lnguges is mn (m + n) m 1 m 1 2, 3,,..., n 1 n Theorem (Nondeterministi stte omplexity of union) The nondeterministi stte omplexity of union of inry suffix-free lnguges is m + n m 1 m n 1 n Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
20 Intersetion nd Union of Suffix-Free Lnguges: Not Only Worst Cses Miniml suffix free Miniml suffix free m stte DFA for K n stte DFA for L Miniml DFA for K L ( for K L )??? sttes Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
21 Intersetion nd Union of Suffix-Free Lnguges: Not Only Worst Cses Miniml suffix free Miniml suffix free Miniml suffix free Miniml suffix free m stte DFA for K n stte DFA for L m stte NFA for K n stte NFA for L Miniml DFA for K L ( for K L )??? sttes Miniml NFAs for K L ( for K L )??? sttes Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
22 Intersetion nd Union of Suffix-Free Lnguges: Not Only Worst Cses Miniml suffix free Miniml suffix free Miniml suffix free Miniml suffix free m stte DFA for K n stte DFA for L m stte NFA for K n stte NFA for L Miniml DFA for K L ( for K L )??? sttes Theorem (Deterministi se) The size of miniml DFA for K L my e 1,2,...,mn 2(m + n) + 6 for ternry lphet. The size of miniml DFA for K L my e 1,2,...,mn 2(m + n) + 6 for ternry lphet. Miniml NFAs for K L ( for K L )??? sttes Theorem (Nondeterministi se) The size of miniml NFA for K L my e 1,2,...,mn (m + n) + 2 for four-letter lphet. The size of miniml NFA for K L my e 2,3,...,m + n 1 for ternry lphet. Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
23 Outline Summry nd Open Prolems Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
24 Summry nd Open Prolems Our Results on Binry Suffix-Free Lnguges: Binry Suffix-Free Binry Regulr s(intersetion) mn 2(m + n) + 6 mn s(union) mn (m + n) + 2 mn ns(intersetion) mn (m + n) + 2 mn ns(union) m + n 1 m + n + 1 Are There Any Holes? s Σ ns Σ K L 1..mn 2(m + n) mn (m + n) K L 1..mn 2(m + n) m + n 1 3 Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
25 Thnk You for Your Attention Glin Jirásková nd Pvol Olejár Binry Suffix-Free Lnguges
Regular languages refresher
Regulr lnguges refresher 1 Regulr lnguges refresher Forml lnguges Alphet = finite set of letters Word = sequene of letter Lnguge = set of words Regulr lnguges defined equivlently y Regulr expressions Finite-stte
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationNondeterministic Biautomata and Their Descriptional Complexity
Nondeterministic Biutomt nd Their Descriptionl Complexity Mrkus Holzer nd Sestin Jkoi Institut für Informtik Justus-Lieig-Universität Arndtstr. 2, 35392 Gießen, Germny 23. Theorietg Automten und Formle
More informationNon-Deterministic Finite Automata. Fall 2018 Costas Busch - RPI 1
Non-Deterministic Finite Automt Fll 2018 Costs Busch - RPI 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q q2 1 q 0 q 3 Fll 2018 Costs Busch - RPI 2 Nondeterministic Finite Automton (NFA) Alphbet
More informationTheory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38
Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationWorked out examples Finite Automata
Worked out exmples Finite Automt Exmple Design Finite Stte Automton which reds inry string nd ccepts only those tht end with. Since we re in the topic of Non Deterministic Finite Automt (NFA), we will
More informationTheory of Computation Regular Languages
Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of
More informationNon Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51
Non Deterministic Automt Linz: Nondeterministic Finite Accepters, pge 51 1 Nondeterministic Finite Accepter (NFA) Alphbet ={} q 1 q2 q 0 q 3 2 Nondeterministic Finite Accepter (NFA) Alphbet ={} Two choices
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationNFA and regex. the Boolean algebra of languages. non-deterministic machines. regular expressions
NFA nd regex l the Boolen lger of lnguges non-deterministi mhines regulr expressions Informtis The intersetion of two regulr lnguges is regulr Run oth mhines in prllel? Build one mhine tht simultes two
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationDeterministic Finite Automata
Finite Automt Deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion Sciences Version: fll 2016 J. Rot Version: fll 2016 Tlen en Automten 1 / 21 Outline Finite Automt Finite
More informationSynchronizing Automata with Random Inputs
Synchronizing Automt with Rndom Inputs Vldimir Gusev Url Federl University, Ekterinurg, Russi 9 August, 14 Vldimir Gusev (UrFU) Synchronizing Automt with Rndom Input 9 August, 14 1 / 13 Introduction Synchronizing
More informationFinite-State Automata: Recap
Finite-Stte Automt: Recp Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 09 August 2016 Outline 1 Introduction 2 Forml Definitions nd Nottion 3 Closure under
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationHybrid Systems Modeling, Analysis and Control
Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt
More informationAnatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute
Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn
More informationFundamentals of Computer Science
Fundmentls of Computer Science Chpter 3: NFA nd DFA equivlence Regulr expressions Henrik Björklund Umeå University Jnury 23, 2014 NFA nd DFA equivlence As we shll see, it turns out tht NFA nd DFA re equivlent,
More informationCHAPTER 1 Regular Languages. Contents. definitions, examples, designing, regular operations. Non-deterministic Finite Automata (NFA)
Finite Automt (FA or DFA) CHAPTER Regulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, equivlence of NFAs DFAs, closure under regulr
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationRunning an NFA & the subset algorithm (NFA->DFA) CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/
Running n NFA & the suset lgorithm (NFA->DFA) CS 350 Fll 2018 gilry.org/lsses/fll2018/s350/ 1 NFAs operte y simultneously exploring ll pths nd epting if ny pth termintes t n ept stte.!2 Try n exmple: L
More informationPrefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationLet's start with an example:
Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationCISC 4090 Theory of Computation
9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationLecture 6 Regular Grammars
Lecture 6 Regulr Grmmrs COT 4420 Theory of Computtion Section 3.3 Grmmr A grmmr G is defined s qudruple G = (V, T, S, P) V is finite set of vribles T is finite set of terminl symbols S V is specil vrible
More informationConverting Regular Expressions to Discrete Finite Automata: A Tutorial
Converting Regulr Expressions to Discrete Finite Automt: A Tutoril Dvid Christinsen 2013-01-03 This is tutoril on how to convert regulr expressions to nondeterministic finite utomt (NFA) nd how to convert
More informationDeterministic Finite-State Automata
Deterministic Finite-Stte Automt Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute of Science, Bnglore. 12 August 2013 Outline 1 Introduction 2 Exmple DFA 1 DFA for Odd number of
More informationPetri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering
Petri Nets Ree Alreht Seminr: Automt Theory Chir of Softwre Engeneering Overview 1. Motivtion: Why not just using finite utomt for everything? Wht re Petri Nets nd when do we use them? 2. Introdution:
More informationCONTROLLABILITY and observability are the central
1 Complexity of Infiml Oservle Superlnguges Tomáš Msopust Astrt The infiml prefix-losed, ontrollle nd oservle superlnguge plys n essentil role in the reltionship etween ontrollility, oservility nd o-oservility
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationCHAPTER 1 Regular Languages. Contents
Finite Automt (FA or DFA) CHAPTE 1 egulr Lnguges Contents definitions, exmples, designing, regulr opertions Non-deterministic Finite Automt (NFA) definitions, euivlence of NFAs nd DFAs, closure under regulr
More informationMyhill-Nerode Theorem
Overview Myhill-Nerode Theorem Correspondence etween DA s nd MN reltions Cnonicl DA for L Computing cnonicl DFA Myhill-Nerode Theorem Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute
More informationChapter 2 Finite Automata
Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht
More informationOperations on Unambiguous Finite Automata
Opertions on Unmbiguous Finite Automt Jozef Jirásek, Jr., Glin Jirásková, 2,, nd Jurj Šebej Mthemticl Institute, Slovk Acdemy of Sciences Grešákov 6, 4 Košice, Slovki jirsekjozef@gmil.com, jirskov@sske.sk
More informationFormal Language and Automata Theory (CS21004)
Forml Lnguge nd Automt Forml Lnguge nd Automt Theory (CS21004) Khrgpur Khrgpur Khrgpur Forml Lnguge nd Automt Tle of Contents Forml Lnguge nd Automt Khrgpur 1 2 3 Khrgpur Forml Lnguge nd Automt Forml Lnguge
More informationQuotient Complexity of Ideal Languages
Quotient Complexity of Idel Lnguges Jnusz Brzozowski,1 Glin Jirásková Biyu Li Dvid R. Cheriton School of Computer Science, University of Wterloo, Wterloo, ON, Cnd N2L 3G1 Mthemticl Institute, Slovk Acdemy
More informationSpeech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research
Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Mehryr Mohri Cournt Institute nd Google Reserch mohri@cims.nyu.com Preliminries Finite lphet Σ, empty string. Set of ll strings over
More informationRegular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene-*
Regulr Expressions (RE) Regulr Expressions (RE) Empty set F A RE denotes the empty set Opertion Nottion Lnguge UNIX Empty string A RE denotes the set {} Alterntion R +r L(r ) L(r ) r r Symol Alterntion
More informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Desriptionl Complexity of Non-Unry Self-Verifying Symmetri Differene Automt Lurette Mris 1,2 nd Lynette vn Zijl 1 1 Deprtment of Computer Siene, Stellenosh University, South Afri 2 Merk Institute, CSIR,
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationJava II Finite Automata I
Jv II Finite Automt I Bernd Kiefer Bernd.Kiefer@dfki.de Deutsches Forschungszentrum für künstliche Intelligenz Finite Automt I p.1/13 Processing Regulr Expressions We lredy lerned out Jv s regulr expression
More informationChapter 1, Part 1. Regular Languages. CSC527, Chapter 1, Part 1 c 2012 Mitsunori Ogihara 1
Chpter 1, Prt 1 Regulr Lnguges CSC527, Chpter 1, Prt 1 c 2012 Mitsunori Ogihr 1 Finite Automt A finite utomton is system for processing ny finite sequence of symols, where the symols re chosen from finite
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationNon-deterministic Finite Automata
Non-deterministic Finite Automt From Regulr Expressions to NFA- Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationOn Determinisation of History-Deterministic Automata.
On Deterministion of History-Deterministic Automt. Denis Kupererg Mich l Skrzypczk University of Wrsw YR-ICALP 2014 Copenhgen Introduction Deterministic utomt re centrl tool in utomt theory: Polynomil
More informationNFAs continued, Closure Properties of Regular Languages
Algorithms & Models of Computtion CS/ECE 374, Fll 2017 NFAs continued, Closure Properties of Regulr Lnguges Lecture 5 Tuesdy, Septemer 12, 2017 Sriel Hr-Peled (UIUC) CS374 1 Fll 2017 1 / 31 Regulr Lnguges,
More informationFinite Automata-cont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationPrefix-Free Subsets of Regular Languages and Descriptional Complexity
Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek Jurj Šeej DCFS 2015 Prefix-Free Susets of Regulr Lnguges nd Descriptionl Complexity Jozef Jirásek, Jurj Šeej 1/22 Outline Mximl
More informationNon-Deterministic Finite Automata
Non-Deterministic Finite Automt http://users.comlb.ox.c.uk/luke. ong/teching/moc/nf2up.pdf 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q1 q2 2 Alphbet ={} Two choices q1 q2 3 Alphbet ={} Two choices
More informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More informationRegular Languages and Applications
Regulr Lnguges nd Applictions Yo-Su Hn Deprtment of Computer Science Yonsei University 1-1 SNU 4/14 Regulr Lnguges An old nd well-known topic in CS Kleene Theorem in 1959 FA (finite-stte utomton) constructions:
More informationLecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
More informationSpeech Recognition Lecture 2: Finite Automata and Finite-State Transducers
Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Eugene Weinstein Google, NYU Cournt Institute eugenew@cs.nyu.edu Slide Credit: Mehryr Mohri Preliminries Finite lphet, empty string.
More informationAutomata Theory 101. Introduction. Outline. Introduction Finite Automata Regular Expressions ω-automata. Ralf Huuck.
Outline Automt Theory 101 Rlf Huuck Introduction Finite Automt Regulr Expressions ω-automt Session 1 2006 Rlf Huuck 1 Session 1 2006 Rlf Huuck 2 Acknowledgement Some slides re sed on Wolfgng Thoms excellent
More informationFormal Languages and Automata
Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University
More informationNFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More information= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationNon Deterministic Automata. Formal Languages and Automata - Yonsei CS 1
Non Deterministic Automt Forml Lnguges nd Automt - Yonsei CS 1 Nondeterministic Finite Accepter (NFA) We llow set of possible moves insted of A unique move. Alphbet = {} Two choices q 1 q2 Forml Lnguges
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationCMSC 330: Organization of Programming Languages. DFAs, and NFAs, and Regexps (Oh my!)
CMSC 330: Orgniztion of Progrmming Lnguges DFAs, nd NFAs, nd Regexps (Oh my!) CMSC330 Spring 2018 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All
More informationToday s Topics Automata and Languages
Tody s Topics Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn DFA to Regulr Expression GFNA DFAèGNFA GNFA è RE DFA è RE Exmples 2 DFA è RE NFA DFA -NFA REX GNFA 3 Definition
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Tody s Topics DFA to Regulr Expression GFNA DFAèGNFA GNFA è RE DFA è RE Exmples 2 DFA è RE NFA DFA -NFA REX GNFA 3 Definition
More informationCSCI565 - Compiler Design
CSCI565 - Compiler Deign Spring 6 Due Dte: Fe. 5, 6 t : PM in Cl Prolem [ point]: Regulr Expreion nd Finite Automt Develop regulr expreion (RE) tht detet the longet tring over the lphet {-} with the following
More informationCSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science
CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny
More informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More informationNon-deterministic Finite Automata
Non-deterministic Finite Automt Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd T. vn Lrhoven Institute for Computing nd Informtion Sciences Intelligent
More informationExercises Chapter 1. Exercise 1.1. Let Σ be an alphabet. Prove wv = w + v for all strings w and v.
1 Exercises Chpter 1 Exercise 1.1. Let Σ e n lphet. Prove wv = w + v for ll strings w nd v. Prove # (wv) = # (w)+# (v) for every symol Σ nd every string w,v Σ. Exercise 1.2. Let w 1,w 2,...,w k e k strings,
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationIn-depth introduction to main models, concepts of theory of computation:
CMPSCI601: Introduction Lecture 1 In-depth introduction to min models, concepts of theory of computtion: Computility: wht cn e computed in principle Logic: how cn we express our requirements Complexity:
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
More informationDFA Minimization and Applications
DFA Minimiztion nd Applictions Mondy, Octoer 15, 2007 Reding: toughton 3.12 C235 Lnguges nd Automt Deprtment of Computer cience Wellesley College Gols for ody o Answer ny P3 questions you might hve. o
More informationCS:4330 Theory of Computation Spring Regular Languages. Equivalences between Finite automata and REs. Haniel Barbosa
CS:4330 Theory of Computtion Spring 208 Regulr Lnguges Equivlences between Finite utomt nd REs Hniel Brbos Redings for this lecture Chpter of [Sipser 996], 3rd edition. Section.3. Finite utomt nd regulr
More informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tble of Contents: Week 1: Preliminries (set lgebr, reltions, functions) (red Chpters 1-4) Weeks
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationNFAs continued, Closure Properties of Regular Languages
lgorithms & Models of omputtion S/EE 374, Spring 209 NFs continued, losure Properties of Regulr Lnguges Lecture 5 Tuesdy, Jnury 29, 209 Regulr Lnguges, DFs, NFs Lnguges ccepted y DFs, NFs, nd regulr expressions
More informationCSC 311 Theory of Computation
CSC 11 Theory of Computtion Tutoril on DFAs, NFAs, regulr expressions, regulr grmmr, closure of regulr lnguges, context-free grmmrs, non-deterministic push-down utomt, Turing mchines,etc. Tutoril 2 Second
More informationFinite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh
Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationClosure Properties of Regular Languages
of Regulr Lnguges Dr. Neil T. Dntm CSCI-561, Colordo School of Mines Fll 2018 Dntm (Mines CSCI-561) Closure Properties of Regulr Lnguges Fll 2018 1 / 50 Outline Introduction Closure Properties Stte Minimiztion
More information