Automorphism Group of an Inverse Fuzzy Automaton
|
|
- Anna Cobb
- 5 years ago
- Views:
Transcription
1 Annls f Pure nd Alied themtics Vl ISS: P nline Pulished n 8 Decemer 0 wwwreserchmthscirg Annls f Autmrhism Gru f n Inverse Fuzzy Autmtn Pmy Sestin nd P Jhnsn Dertment f themtics ry th Arts & Science llege nnthvdy Kerl E-mil: myse@gmilcm Alied Science nd Humnities Divisin Schl f Engineering chin University f Science & echnlgy chin- E-mil: tjhnsn@custcin Received 3 Decemer 0; cceted 7 Decemer 0 Astrct In this er we define n inverse fuzzy utmtn such tht the crresnding trnsitin mnid is n inverse mnid We ls study the structure f the utmrhism gru f n inverse fuzzy utmtn nd rve tht it is eul t sugru f the symmetric inverse mnid f ne ne rtil fuzzy trnsfrmtins n Keywrds: Inverse fuzzy utmt invertile fuzzy lnguges inverse mnid AS themtics Suject lssifictins 00: 8B0 Intrductin An utmtn is mdel f seuentil switching circuit with finite numer f stteswith stte chnging when it is sujected t n inut syml A seuentil mchine cnsits f tw min structures the trnsitin structure nd the utut structure Since ur interest is in the trnsitin structure f n utmtn nd its inut semigru ututs re nt cnsidered here Zdeh intrduced the cncet f fuzzy sets nd W G Wee intrduced fuzzy utmt he thery f inverse mnids were intrduced indeendently y Wgner nd Prestn vi the study f rtil ne-ne trnsfrmtins f set We define n inverse fuzzy utmtn such tht its trnsitin mnid is n inverse mnid nd study the structure f the utmrhism gru f n inverse fuzzy utmtn Preliminries his sectin resent sic definitins nd results t e used in the seuel A semigru S is sid t e n inverse semigru if fr every S there exist uniue S 67
2 Pmy Sestin nd P Jhnsn such tht nd We cll the inverse f nd dente y If S hs n identity then S is sid t e n inverse mnid Inverse mnids frm vriety defined y the identities Als nd Fr ny element f n inverse mnid is n idemtent nd idemtents in n inverse mnid cmmute An inverse mnid with single idemtent is gru As n nlgus t yleys therem fr grus Prestn nd Wgner rved tht n inverse mnid I is ismrhic t suinverse mnid f the mnid f ll ne-ne rtil trnsfrmtins n I A fuzzy utmtn n n lhet is 5-tule i τ where is finite set f sttes is finite set f inut symls nd is fuzzy suset f reresenting the trnsitin ming i is fuzzy suset f clled initil stte τ is fuzzy suset f clled finl stte is clled fuzzy finite stte mchine A fuzzy utmtn cn ls e reresented s five tule { u u } iτ where { u u } is the set f fuzzy trnsitin mtrices i [ i i i ] i [0] τ [ j j j ] j [0] fr k n n k n k cn e extended t the set y Λ 0 u { x x L i xx xk u} Let i τ e fuzzy utmtn We sy the trile is the fuzzy finite stte mchine sscited with Fr is clled n immedite successr f if there exist n such tht > 0 is clled successr f if there exist k x k x such tht x > 0 Let S e the set f ll successrs f Let he set f ll successrs f dented y S { S } where is fuzzy suset f is clled sumchine f if nd S is sid t e serted if S φ is sid t e cnnected if hs n serted rer sumchines Let nd e fuzzy finite stte mchines A ir f mings : nd : is clled hmmrhism written : if x x nd x is clled strng hmmrhism if 68
3 Autmrhism Gru f n Inverse Fuzzy Autmtn x { x t t t } nd x A hmmrhism is sid t e n ismrhism if nd re th ne ne nd nt If nd is the identity m then we write : is hmmrhism If is strng hmmrhism with ne-ne then x x nd x see [5] Let e fuzzy finite stte mchine nsider the set f ll strng hmmrhisms : dented y ED nd the set f ll strng ismrhisms frm y AU ED frm mnid under the ertin nd AU frm gru where the inverse f is msitin is sscitive nd identity is the ir f identity ms n nd If is the identity m n then we dente ED s End nd AU s Aut hen End is sumnid f ED nd Aut is sugru f AU Define cngruence s u v iff u v cngruence nd see [6] nsidering the cllectin f ll fuzzy finite stte utmt s ctegry F-AU with jects re fuzzy utmt ver finite set f sttes nd mrhisms s the utmt hmmrhisms etween them rresnds t every fuzzy utmt n hen is we get finite mnid nd every finite mnid is the trnsitin mnid f the miniml fuzzy utmtn recgnizing sme fuzzy lnguge which is clled the syntctic mnid f tht fuzzy lnguge see [6] 3 Inverse Fuzzy Autmt nd the Autmrhism Gru Definitin 3 A cnnected fuzzy utmtn is sid t e n inverse fuzzy utmtn if there exist uniue such tht nd herem 3 A fuzzy utmtn A i τ is inverse if nd nly if A is n inverse mnid Prf Suse A is n inverse fuzzy utmtn ie fr ech there exist uniue such tht nd A nd A [ ] [ ] nd [ ] [ ] hen [ ][ ][ ] [ ] nd [ ][ ][ ] [ ] A is n inverse mnid 69
4 Pmy Sestin nd P Jhnsn Lemm 3 If AU then fr ny u v u v u v Prf u v u v u v v since is ne-ne u v Let nd e tw fuzzy utmt nd let e mrhism etween them Let nd e the crresnding trnsitin mnids Let f : t defined y f [ u] [ u] u herem 3 Let nd e tw jects in the ctegry F AU nd let HO hen f f re semigru mrhisms nd f f f hus the ms nd f HO Prf f nd f re well defined y the ve lemm Let [ u][ v] where u v hen f [ u][ v] f [ uv] [ uv] [ u v] [ u][ v] f [ u] f [ v] S f is semigru mrhism f [ ] [ ] [ ] [ ] u u f u f f u We cn define cvrint functr F etween the ctegry f fuzzy utmt nd the ctegry f finite semigrus s F nd F f fr HO he set f ll inverse fuzzy utmt frm full suctegry f F AU nd F s defined ve is functr frm this suctegry t the ctegry f finite inverse mnids which is suctegry f finite mnids Definitin 3 A fuzzy utmtn is sid t e fithful if fr herem 33 Let e fithful fuzzy utmt Let e the trnsitin mnid nsider AU f ll utmrhisms n Let h : AU AU e m defined y h f hen h is gru hmmrhism nd Kerh Aut f 70
5 Autmrhism Gru f n Inverse Fuzzy Autmtn Prf Ker h { : h f } where f [ u] [ u] fr ll u u u is the identity m n hus Ker h Aut u [ u] [ u] u u u u u rllry By hmmrhism therem fr grus AU Aut is ismrhic t sugru f AU nsider the set f ll ne-ne rtil fuzzy trnsfrmtins n which is the symmetric inverse mnid f fuzzy trnsfrmtins dented s FI We cn cnsider FI s cllectin f fuzzy mtrices f crdinlity with tmst ne nnzer entry in ech rw nd clumn Fr ech FI there exist uniue inverse FI such tht Dm In mtrix frm it is the trnsse f the fuzzy mtrix crresnding t he trnsitin mnid f n inverse fuzzy utmtn is suinverse mnid f FI nsider { FI : } nd { FI : } where the cmsitin is the mx-min cmsitin f fuzzy mtrices Lemm 3 Let e fithful inverse fuzzy utmtn Let hen fr ny there exist uniue such tht Prf Since fr there exist such tht rve the uniueness suse there exist nther c such tht c hen since is ne-ne tmst ne nnzer entry will e there in ech rw nd clumn f the fuzzy mtrix crresnding t c c c c Let { Dm } nd { γ Dm γ } 7
6 Pmy Sestin nd P Jhnsn 7 herem 34 Let e fithful inverse fuzzy utmtn then Aut Prf Let Aut hen is the identity m n nd is ne-ne ming frm nt stisfying ie nsider since nversely let hen fr sme with nd nd clerly is ne-ne nd nt hus Aut herem 35 Let e fithful inverse fuzzy utmtn then AU Prf Let AU hen AU ie Euivlently Let Since is ne-ne nversely let hen y the lemm there exist such tht Define : s with hen is well defined ijectin frlet u t hen t c nd u d where c t nd d u hen d c nd s u t u t is nt fr ny nd y lemm there exist uniue such tht ie
7 Autmrhism Gru f n Inverse Fuzzy Autmtn 73 there exist n such tht w is hmmrhism fr let with ie with hus hus we hve rved tht AU herem 36 is nrml sugru f r euivlently Aut is nrml sugru f AU Prf Let Let Since there exist uniue such tht nd nsider hus is nrml sugru f rllry By the therem 5 nd the crllry is sugru f AU REFEREES A H liffrd nd G B Prestn he Algeric hery f Semigrus Amer th Sc 7 Prvidence RI 96 Gerge J Klir nd B Yun Fuzzy Sets nd Fuzzy Lgic hery nd Alictins Prentice-Hll Inc E Lee nd L A Zdeh te n Fuzzy Lnguges Infrmtin Sciences hing-hng Prk Sme remrks n the Autmt Hmmrhisms mm Kren th Sc Jhn dersn nd Devender S lik Fuzzy Autmt nd Lnguges hery nd Alictins hmn nd HllR 00 6 tjn Petkvic Vrieties f Fuzzy lnguges Prc in First Interntinl nference n Algeric Infrmtics Aristtle University f hesslniki L A Zdeh Fuzzy Sets Infrm nd ntrl
SMARANDACHE GROUPOIDS
SMARANDACHE GROUPOIDS W. B. Vsnth Kndsmy Deprtment f Mthemtics Indin Institute f Technlgy Mdrs Chenni - 6 6 Indi. E-mil: vsntk@md.vsnl.net.in Astrct: In this pper we study the cncept f Smrndche Grupids
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationI. Theory of Automata II. Theory of Formal Languages III. Theory of Turing Machines
CI 3104 /Winter 2011: Introduction to Forml Lnguges Chter 13: Grmmticl Formt Chter 13: Grmmticl Formt I. Theory of Automt II. Theory of Forml Lnguges III. Theory of Turing Mchines Dr. Neji Zgui CI3104-W11
More informationA negative answer to a question of Wilke on varieties of!-languages
A negtive nswer to question of Wilke on vrieties of!-lnguges Jen-Eric Pin () Astrct. In recent pper, Wilke sked whether the oolen comintions of!-lnguges of the form! L, for L in given +-vriety of lnguges,
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 informationA new Type of Fuzzy Functions in Fuzzy Topological Spaces
IOSR Jurnal f Mathematics (IOSR-JM e-issn: 78-578, p-issn: 39-765X Vlume, Issue 5 Ver I (Sep - Oct06, PP 8-4 wwwisrjurnalsrg A new Type f Fuzzy Functins in Fuzzy Tplgical Spaces Assist Prf Dr Munir Abdul
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 informationIntroduction To Matrices MCV 4UI Assignment #1
Introduction To Mtrices MCV UI Assignment # INTRODUCTION: A mtrix plurl: mtrices) is rectngulr rry of numbers rrnged in rows nd columns Exmples: ) b) c) [ ] d) Ech number ppering in the rry is sid to be
More informationLanguage Processors F29LP2, Lecture 5
Lnguge Pocessos F29LP2, Lectue 5 Jmie Gy Feuy 2, 2014 1 / 1 Nondeteministic Finite Automt (NFA) NFA genelise deteministic finite utomt (DFA). They llow sevel (0, 1, o moe thn 1) outgoing tnsitions with
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 informationWatson-Crick local languages and Watson-Crick two dimensional local languages
Interntionl Journl of Mthemtics nd Soft Comuting Vol.5 No.. (5) 65-7. ISSN Print : 49 338 ISSN Online: 39 55 Wtson-Crick locl lnguges nd Wtson-Crick two dimensionl locl lnguges Mry Jemim Smuel nd V.R.
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 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 informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
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 information80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES. 2.6 Finite State Automata With Output: Transducers
80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES 2.6 Finite Stte Automt With Output: Trnsducers So fr, we hve only considered utomt tht recognize lnguges, i.e., utomt tht do not produce ny output on ny input
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 informationOn-Line Construction. of Suffix Trees. Overview. Suffix Trees. Notations. goo. Suffix tries
On-Line Cnstrutin Overview Suffix tries f Suffix Trees E. Ukknen On-line nstrutin f suffix tries in qudrti time Suffix trees On-line nstrutin f suffix trees in liner time Applitins 1 2 Suffix Trees A suffix
More informationIntroduction to Three-phase Circuits. Balanced 3-phase systems Unbalanced 3-phase systems
Intrductin t Three-hse Circuits Blnced 3-hse systems Unblnced 3-hse systems 1 Intrductin t 3-hse systems Single-hse tw-wire system: Single surce cnnected t ld using tw-wire system Single-hse three-wire
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 informationRectangular group congruences on an epigroup
cholrs Journl of Engineering nd Technology (JET) ch J Eng Tech, 015; 3(9):73-736 cholrs Acdemic nd cientific Pulisher (An Interntionl Pulisher for Acdemic nd cientific Resources) wwwsspulishercom IN 31-435X
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
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 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 informationI. Theory of Automata II. Theory of Formal Languages III. Theory of Turing Machines
CI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 16: Non-Context-Free Lnguges Chpter 16: Non-Context-Free Lnguges I. Theory of utomt II. Theory of Forml Lnguges III. Theory of Turing Mchines
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
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 informationModel Reduction of Finite State Machines by Contraction
Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900
More informationGENERALIZED OSTROWSKI TYPE INEQUALITIES FOR FUNCTIONS WHOSE LOCAL FRACTIONAL DERIVATIVES ARE GENERALIZED s-convex IN THE SECOND SENSE
Journl of Alied Mthemtics nd Comuttionl Mechnics 6, 5(4), - wwwmcmczl -ISSN 99-9965 DOI: 75/jmcm64 e-issn 353-588 GENERALIZED OSTROWSKI TYPE INEQUALITIES FOR FUNCTIONS WHOSE LOCAL FRACTIONAL DERIVATIVES
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 informationad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)
10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.
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 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 informationChapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY
Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in
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 informationCONTROL SYNTHESIS VIA ALTERNATING SIMULATIONS AND OPEN MAPS PAULO TABUADA
CONTROL SYNTHESIS VIA ALTERNATING SIULATIONS AND OPEN APS PAULO TABUADA Abstrct. Cntrl synthesis is slwly trnscending its trditinl pplictin dmin within engineering t find interesting nd useful pplictins
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 informationSome integral inequalities on time scales
Al Mth Mech -Engl Ed 2008 29(1:23 29 DOI 101007/s10483-008-0104- c Editoril Committee of Al Mth Mech nd Sringer-Verlg 2008 Alied Mthemtics nd Mechnics (English Edition Some integrl ineulities on time scles
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationOn Hermite-Hadamard type integral inequalities for functions whose second derivative are nonconvex
Mly J Mt 34 93 3 On Hermite-Hdmrd tye integrl ineulities for functions whose second derivtive re nonconvex Mehmet Zeki SARIKAYA, Hkn Bozkurt nd Mehmet Eyü KİRİŞ b Dertment of Mthemtics, Fculty of Science
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 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 informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationLumpability and Absorbing Markov Chains
umbility nd Absorbing rov Chins By Ahmed A.El-Sheih Dertment of Alied Sttistics & Econometrics Institute of Sttisticl Studies & Reserch (I.S.S.R Ciro University Abstrct We consider n bsorbing rov Chin
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More informationRecursively Enumerable and Recursive. Languages
Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings
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 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 informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
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 information2. Caryn needs to ship a box that is 14 high, 12 inches deep and 24 inches long. After sealing the box, she tied it with twine as shown:
Perimeter Mtters 1. Mrt wnts t tie rin rund the sides f hexgnl x nd then tie w. ch side f the x is 4 inches lng. She needs 14 inches fr the w. Is ne yrd f rin enugh? xlin. hen stte exctly hw lng the rin
More information11.2. Infinite Series
.2 Infinite Series 76.2 Infinite Series An infinite series is the sum f n infinite seuence f numbers + 2 + 3 + Á + n + Á The gl f this sectin is t understnd the mening f such n infinite sum nd t develp
More informationTries and suffixes trees
Trie: A dt-structure for set of words Tries nd suffixes trees Alon Efrt Comuter Science Dertment University of Arizon All words over the lhet Σ={,,..z}. In the slides, let sy tht the lhet is only {,,c,d}
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 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 informationAlgebraic systems Semi groups and monoids Groups. Subgroups and homomorphisms Cosets Lagrange s theorem. Ring & Fields (Definitions and examples)
Prepred y Dr. A.R.VIJAYALAKSHMI Algeric systems Semi groups nd monoids Groups Sugroups nd homomorphms Cosets Lgrnge s theorem Ring & Fields (Definitions nd exmples Stndrd Nottions. N :Set of ll nturl numers.
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 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 informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
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 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 informationInner-product spaces
Inner-product spces Definition: Let V be rel or complex liner spce over F (here R or C). An inner product is n opertion between two elements of V which results in sclr. It is denoted by u, v nd stisfies:
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 informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
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 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 informationarxiv: v1 [math.ra] 1 Nov 2014
CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,
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 informationQUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN
QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The
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 informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationOn the free product of ordered groups
rxiv:703.0578v [mth.gr] 6 Mr 207 On the free product of ordered groups A. A. Vinogrdov One of the fundmentl questions of the theory of ordered groups is wht bstrct groups re orderble. E. P. Shimbirev [2]
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationFuzzy Neutrosophic Equivalence Relations
wwwijirdm Jur 6 Vl 5 ssue SS 78 Olie u eutrsphi Equivlee eltis J Mrti Je eserh Shlr Deprtmet f Mthemtis irml Cllege fr Wme Cimtre mil du di rkiri riipl irml Cllege fr Wme Cimtre mil du di strt: his pper
More informationMAT 1275: Introduction to Mathematical Analysis
1 MT 1275: Intrdutin t Mtemtil nlysis Dr Rzenlyum Slving Olique Tringles Lw f Sines Olique tringles tringles tt re nt neessry rigt tringles We re ging t slve tem It mens t find its si elements sides nd
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
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 information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationSOME INTEGRAL INEQUALITIES OF GRÜSS TYPE
RGMIA Reserch Report Collection, Vol., No., 998 http://sci.vut.edu.u/ rgmi SOME INTEGRAL INEQUALITIES OF GRÜSS TYPE S.S. DRAGOMIR Astrct. Some clssicl nd new integrl inequlities of Grüss type re presented.
More informationSupplement 4 Permutations, Legendre symbol and quadratic reciprocity
Sulement 4 Permuttions, Legendre symbol nd qudrtic recirocity 1. Permuttions. If S is nite set contining n elements then ermuttion of S is one to one ming of S onto S. Usully S is the set f1; ; :::; ng
More informationIntuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras
Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi
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 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 informationOptimization of frequency quantization. VN Tibabishev. Keywords: optimization, sampling frequency, the substitution frequencies.
UDC 519.21 Otimizatin f frequency quantizatin VN Tibabishev Asvt51@nard.ru We btain the functinal defining the rice and quality f samle readings f the generalized velcities. It is shwn that the timal samling
More informationRiemann Stieltjes Integration - Definition and Existence of Integral
- Definition nd Existence of Integrl Dr. Adity Kushik Directorte of Distnce Eduction Kurukshetr University, Kurukshetr Hryn 136119 Indi. Prtition Riemnn Stieltjes Sums Refinement Definition Given closed
More informationPRIMES AND QUADRATIC RECIPROCITY
PRIMES AND QUADRATIC RECIPROCITY ANGELICA WONG Abstrct We discuss number theory with the ultimte gol of understnding udrtic recirocity We begin by discussing Fermt s Little Theorem, the Chinese Reminder
More informationAdmissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs
Admissibility Cnditins and Asympttic Behavir f Strngly Regular Graphs VASCO MOÇO MANO Department f Mathematics University f Prt Oprt PORTUGAL vascmcman@gmailcm LUÍS ANTÓNIO DE ALMEIDA VIEIRA Department
More informationCS375: Logic and Theory of Computing
CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tle of Contents: Week 1: Preliminries (set lger, reltions, functions) (red Chpters 1-4) Weeks
More informationLyapunov Stability Stability of Equilibrium Points
Lyapunv Stability Stability f Equilibrium Pints 1. Stability f Equilibrium Pints - Definitins In this sectin we cnsider n-th rder nnlinear time varying cntinuus time (C) systems f the frm x = f ( t, x),
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 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 informationMAT 1275: Introduction to Mathematical Analysis
MAT 75: Intrdutin t Mthemtil Anlysis Dr. A. Rzenlyum Trignmetri Funtins fr Aute Angles Definitin f six trignmetri funtins Cnsider the fllwing girffe prlem: A girffe s shdw is 8 meters. Hw tll is the girffe
More information7. SOLVING OBLIQUE TRIANGLES: THE LAW OF SINES
7 SOLVING OLIQUE TRINGLES: THE LW OF SINES n ique tringe is ne withut n nge f mesure 90 When either tw nges nd side re knwn (S) in the tringe r tw sides nd the nge ppsite ne f them (SS) is given, then
More information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
More information