SMARANDACHE GROUPOIDS

Size: px
Start display at page:

Download "SMARANDACHE GROUPOIDS"

Transcription

1 SMARANDACHE GROUPOIDS W. B. Vsnth Kndsmy Deprtment f Mthemtics Indin Institute f Technlgy Mdrs Chenni Indi. E-mil: vsntk@md.vsnl.net.in Astrct: In this pper we study the cncept f Smrndche Grupids sugrupids idel f grupids semi-nrml sugrupids Smrndche-Bl grupids nd Strng Bl grupids nd tin mny interesting results ut them. Keywrds: Smrndche grupid Smrndche sugrupid Smrndche idel f Smrndche grupid Smrndche semi-nrml grupid Smrndche nrml grupid Smrndche semi cnjugte sugrupids Smrndche Bl grupid Smrndche Mufng grupid Definitin []: A grupid (G ) is nn-empty set clsed with respect t n pertin (in generl need nt t e sscitive).. Definitin : A Smrndche Grupid G is grupid which hs prper suset S G which is semigrup under the pertin f G. Exmple : Let (G ) e grupid n mdul 6 integers. G = { 5} is given y the fllwing tle: Clerly S = { } S = { } nd S = { 5} re semigrups f G. S (G ) is Smrndche grupid. Exmple : Let G = {56789} e the set f integers mdul. Define n pertin n G y chsing pir ( 5) such tht = + 5 (md ) fr ll G.

2 The grupid is given y the fllwing tle Clerly S = { 5} S = { 6} S = { 7} S = { 8}nd S 5 = { 9} re semigrups under the pertin. Thus {G ( 5)} is Smrndche grupid. Therem : Let Z p = {... p -}. Define n Z p fr Z p y = + p (md p). {Z p (p)} is Smrndche grupid. Prf: Under the pertin defined n Z p we see S = { p} S = { p+} S = { p + }... S p = {p - p - } re semigrups under the pertin. Hence {Z p (p)} is Smrndche grupid. Exmple : Tke Z 6 = { 5}. ( 5) = (m n). Fr Z 6 define = m + n (md 6). The grupid is given y the fllwing tle: Every singletn is n idemptent semigrup f Z 6. Therem : Let Z p = {... p-}. Define n Z p y = + (p-) (md p) fr Z p. Then {Z p ( p - )} is Smrndche grupid. Prf: Under the pertin defined n Z p we see tht every element f Z p is idemptent therefre every element frms singletn semigrup. Hence the clim. Exmple : Cnsider Z 6 = {Z 6 ( 5)} given y the fllwing tle:

3 {} is semigrup. Hence is Smrndche grupid. It is esily verified tht Z 6 is Smrndche grupid s {Z 6 ( 5)} hs n idemptent semigrup {} under. Therem : Let Z p = {... p-} e the set f integers mdul p. Define n Z p y (p - ) + (p - ) (md p). Then {Z p (p - p - )} is Smrndche grupid. Prf: Z p = {... p - }. Tke (p - p - ) = frm Z p. Fr Z p define = (p - ) + (p - ) (md p). Clerly fr = = p we hve (p- )p + (p - )p = p(md p). Hence {p} is n idemptent semigrup f Z p. S {Z p (p - p - )} is Smrndche grupid. Definitin 5: Let (G ) e Smrndche grupid. A nn-empty suset H f G is sid t e Smrndche Sugrupid if H cntins prper suset K H such tht K is semigrup under the pertin. Therem 6: Nt every sugrupid f Smrndche grupid S is in generl Smrndche sugrupid f S. Prf: By n exmple. Let Z 6 = { 5} (md 6). Tke (t u) = ( 5) =. Fr Z 6 define n Z 6 y = t + u (md 6) given y the fllwing tle: Clerly {Z 6 ( 5)} is Smrndche grupid fr it cntins { } s semigrup. But this grupid hs the fllwing sugrupids:

4 A = { } nd A = { 5}. A hs n nn-trivil semigrup ({} is trivil semigrup). But A hs nn-trivil semigrup viz. {}. Hence the clim. Therem 7: If grupid cntins Smrndche sugrupid then the grupid is Smrndche grupid. Prf: Let G e grupid nd H G e Smrndche sugrupid tht is H cntins prper suset P H such tht P is semigrup. S P G nd P is semigrup. Hence G is Smrndche grupid. Definitin 8: i) A Smrndche Left Idel A f the Smrndche Grupid G stisfies the fllwing cnditins:. A is Smrndche sugrupid. Fr ll x G nd A x A. ii) Similrly ne defines Smrndche Right Idel. iii) If A is th Smrndche right nd left idels then A is Smrndche Idel. We tke {} s trivil Smrndche idel. Exmple 5: Let {Z 6 ( 5)} e Smrndche grupid. A = { 5} is Smrndche sugrupid nd A is Smrndche left idel nd nt Smrndche right idel. Esy t verify. Therem 9: Let G e grupid. An idel f G in generl is nt Smrndche idel f G even if G is Smrndche grupid. Prf: By n exmple. Cnsider the grupid G = {Z 6 ( )} given y the fllwing tle. 5 5 Clerly G is Smrndche grupid fr { } is semigrup f G. Nw {} is n idel f G ut is nt Smrndche idel s {} is nt Smrndche sugrupid. Definitin : Let G e Smrndche grupid nd V e Smrndche sugrupid f G. We sy V is Smrndche semi-nrml sugrupid if:. V = X fr ll G.. V = Y fr ll G. where either X r Y is Smrndche sugrupid f G ut X nd Y re th sugrupids.

5 Exmple 6: Cnsider the grupid G = {Z 6 ( 5)} given y the tle Clerly G is Smrndche grupid s {} is semigrup. Tke A = { 5}. A is ls Smrndche sugrupid. Nw A = A is Smrndche grupid. A = { }. { } is nt Smrndche sugrupid f G. Hence A is Smrndche semi-nrml sugrupid. Definitin : Let A e Smrndche grupid nd V e Smrndche sugrupid. V is sid t e Smrndche nrml sugrupid if V = X nd V = Y where th X nd Y re Smrndche sugrupids f G. Therem : Every Smrndche nrml sugrupid is Smrndche seminrml sugrupid nd nt cnversely. Prf: By the definitins nd we see every Smrndche nrml sugrupid is Smrndche semi-nrml sugrupid. We prve the cnverse y n exmple. In Exmple 6 we see A is Smrndche semi-nrml sugrupid ut nt nrml sugrupid s A = { } is nly sugrupid nd nt Smrndche sugrupid. Exmple 7: Let G = {Z 8 ( 6)} e grupid given y the fllwing tle: Clerly G is Smrndche grupid fr { } is semigrup f G. A = { 6} is Smrndche sugrupid. Clerly A = A nd A = A fr ll G. S A is Smrndche nrml sugrupid f G. 5

6 Definitin : Let G e Smrndche grupid H nd P e sugrupids f G we sy H nd P re Smrndche semi-cnjugte sugrupids f G if:. H nd P re Smrndche sugrupids. H = xp r Px r P = xh r Hx fr sme x G. Definitin : Let G e Smrndche grupid. H nd P e sugrupids f G. We sy H nd P re Smrndche cnjugte sugrupids f G if:. H nd P re Smrndche sugrupids. H = xp r Px fr sme x G.. P = xh r Hx fr sme x G. Exmple 8: Cnsider the grupid G = {Z ( )} which is given y the fllwing tle: Clerly G is Smrndche grupid fr { 6} is semigrup f G. Let A = {69} nd A = { 5 8 } e tw sugrupids. Clerly A nd A re Smrndche sugrups f G s { 6} nd { 8} re semigrups f A nd A respectively. Nw: A = { 5 8 } = A = { 6 9} nd similrly: A = { 6 9} = A. Hence A nd A re cnjugte Smrndche sugrupids f G. Definitin 5: Let G G G... G n e n grupids. We sy G = G G... G n is Smrndche direct prduct f grupids if G hs prper suset H f G which is semigrup under the pertins f G. It is imprtnt t nte tht ech G i need nt e Smrndche grupid fr in tht cse G will e viusly Smrndche grupid. Hence we tke ny set f n grupids nd find the direct prduct. 6

7 7 Definitin 6: Let (G ) nd (G' ) e ny tw Smrndche grupids. A mp φ frm (G ) t (G' ) is sid t e Smrndche grupid hmmrphism if φ ( ) = φ() φ() fr ll A. We sy the Smrndche grupid hmmrphism is n ismrphism if φ is n ismrphism. Definitin 7: Let G e Smrndche grupid. We sy G is Smrndche cmmuttive grupid if there is prper suset A f G which is cmmuttive semigrup under the pertins f G. Definitin 8: Let G e Smrndche grupid. We sy G is Smrndche inner cmmuttive grupid if every semigrup cntined in every Smrndche sugrupid f G is cmmuttive. Therem 9: Every Smrndche inner cmmuttive grupid G is Smrndche cmmuttive grupid nd nt cnversely. Prf: By the very definitins 8 nd 9 we see if G is Smrndche inner cmmuttive grupid then G is Smrndche cmmuttive grupid. T prve the cnverse we prve it y n exmple. Let Z = { } e integers mdul. Cnsider set f ll mtrices with entries frm Z = ( ) dente it y M. M =. M is mde int grupid y fr A = nd = in M. A B = = (md ) (md ) (md ) (md ) Clerly (M ) is Smrndche grupid fr =. S is semigrup.

8 8 Nw cnsider A = is Smrndche sugrupid ut A is nn-cmmuttive Smrndche grupid fr A cntins nn-cmmuttive semigrup S. S = such tht = nd =. S (M ) is Smrndche cmmuttive grupid ut nt Smrndche inner cmmuttive grupid. Definitin : A grupid G is sid t e Mufng grupid if fr every x y z in G we hve (xy)(zx) = (x(yz))x. Definitin : A Smrndche grupid (G ) is sid t e Smrndche- Mufng grupid if there exists H G such tht H is Smrndche sugrupid stisfying the Mufng identity: (xy)(zx) = (x(yz)x) fr ll x y z in H. Definitin : Let S e Smrndche grupid. If every Smrndche sugrupid H f S stisfies the Mufng identity fr ll x y z in H then S is Smrndche Strng Mufng grupid. Therem : Every Smrndche Strng Mufng grupid is Smrndche Mufng grupid nd nt cnversely. Prf: Every Strng Smrndche Mufng grupid is Smrndche Mufng grupid. The prf f the cnverse cn e prved y cnstructing exmples. Definitin : A grupid G is sid t e Bl grupid if ((xy)z)y = x((yz))y fr ll x y z G. Definitin 5: Let G e grupid. G is sid t e Smrndche-Bl grupid if G hs sugrupid H f G such tht H is Smrndche sugrupid nd stisfies the identity ((xy)z)y = x((yz)y) fr ll x y z in H. Definitin 6: Let G e grupid. We sy G is Smrndche Strng Bl grupid if every Smrndche sugrupid f G is Bl grupid. Therem 7: Every Smrndche Strng Bl grupid is Smrndche Bl grupid nd the cnverse is nt true. Prf: Ovius.

9 Therem 8: Let Z n = {... n-} e the set f integers mdul n. Let G = {Z n (t u)} e Smrndche grupid. G is Smrndche Bl grupid if t = t (md n) nd u = u (md n). Prf: Esy t verify. Exmple 9: Let G = {Z 6 ()} defined y the fllwing tle: { } is Smrndche sugrupid nd since = (md 6) nd = (md 6) we see G is Smrndche Bl grupid. Prlem : Let Z n = {... n-} e the ring f integers mdul n. G = {Z n (tu)} e grupid. Find cnditins n n t nd u s tht G:. is Smrndche grupid.. hs Smrndche semi-nrml sugrupids.. hs Smrndche nrml sugrupids.. is Smrndche cmmuttive. 5. is Smrndche inner cmmuttive. 6. is Smrndche-Bl grupid. 7. is Smrndche Strng Bl grupid. 8. is Smrndche-Mufng grupid. 9. is Smrndche-Strng-Mufng grupid.. hs lwys pir f Smrndche cnjugte sugrupids. References: [] R. H. Bruck A Survey f Binry Systems Springer Verlg 958. [] Rul Pdill Smrndche Algeric Structures Bulletin f Pure nd Applied Sciences Delhi Vl. 7 E. N ; [] W. B. Vsnth Kndsmy On rdered grupids nd its grupid rings J. f Mthemtics nd Cmp. Sci. Vl

Automorphism Group of an Inverse Fuzzy Automaton

Automorphism Group of an Inverse Fuzzy Automaton Annls f Pure nd Alied themtics Vl 0 67-73 ISS: 79-087 P 79-0888nline Pulished n 8 Decemer 0 wwwreserchmthscirg Annls f Autmrhism Gru f n Inverse Fuzzy Autmtn Pmy Sestin nd P Jhnsn Dertment f themtics ry

More information

Homology groups of disks with holes

Homology groups of disks with holes Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.

More information

OVERVIEW Using Similarity and Proving Triangle Theorems G.SRT.4

OVERVIEW Using Similarity and Proving Triangle Theorems G.SRT.4 OVRVIW Using Similrity nd Prving Tringle Therems G.SRT.4 G.SRT.4 Prve therems ut tringles. Therems include: line prllel t ne side f tringle divides the ther tw prprtinlly, nd cnversely; the Pythgren Therem

More information

FINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B.

FINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B. FINITE BOOLEAN ALGEBRA 1. Decnstructing Blean algebras with atms. Let B = be a Blean algebra and c B. The ideal generated by c, (c], is: (c] = {b B: b c} The filter generated by c, [c), is:

More information

A new Type of Fuzzy Functions in Fuzzy Topological Spaces

A 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 information

set is not closed under matrix [ multiplication, ] and does not form a group.

set 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 information

MAT 1275: Introduction to Mathematical Analysis

MAT 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 information

MAT 1275: Introduction to Mathematical Analysis

MAT 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 information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

a n = 1 58 a n+1 1 = 57a n + 1 a n = 56(a n 1) 57 so 0 a n+1 1, and the required result is true, by induction.

a n = 1 58 a n+1 1 = 57a n + 1 a n = 56(a n 1) 57 so 0 a n+1 1, and the required result is true, by induction. MAS221(216-17) Exm Solutions 1. (i) A is () bounded bove if there exists K R so tht K for ll A ; (b) it is bounded below if there exists L R so tht L for ll A. e.g. the set { n; n N} is bounded bove (by

More information

Multidimensional. MOD Planes. W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache

Multidimensional. MOD Planes. W. B. Vasantha Kandasamy Ilanthenral K Florentin Smarandache Multidimensionl MOD Plnes W. B. Vsnth Kndsmy Ilnthenrl K Florentin Smrndche 2015 This book cn be ordered from: EuropNov ASBL Clos du Prnsse, 3E 1000, Bruxelles Belgium E-mil: info@europnov.be URL: http://www.europnov.be/

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, 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 information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

smarandache semirings, semifields, and semivector spaces

smarandache semirings, semifields, and semivector spaces w.. vsnth kndsmy smrndche semirings, semifields, nd semivector spces {,,c,d} {,,c} {,,d} {,d,c} {,d,c} {,} {,c} {,d} {,c} {,d} {d,c} {} {} {c} {d} {φ} mericn reserch press rehooth 22 Smrndche Semirings,

More information

Results on Planar Near Rings

Results on Planar Near Rings Interntionl Mthemticl Forum, Vol. 9, 2014, no. 23, 1139-1147 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/imf.2014.4593 Results on Plnr Ner Rings Edurd Domi Deprtment of Mthemtics, University

More information

Neutrosophic Subset Semigroups

Neutrosophic Subset Semigroups MOD Nturl Neutrosophic Subset Semiroups W. B. Vsnth Kndsmy lnthenrl K Florentin Smrndche 216 MOD Nturl Neutrosophic Subset Semiroups 2 Copyriht 216 by EuropNov ASBL nd the Authors Peer reviewers: Prof.

More information

On Topological Structures and. Fuzzy Sets

On Topological Structures and. Fuzzy Sets L - ZHR UNIVERSIT - GZ DENSHIP OF GRDUTE STUDIES & SCIENTIFIC RESERCH On Tplgical Structures and Fuzzy Sets y Nashaat hmed Saleem Raab Supervised by Dr. Mhammed Jamal Iqelan Thesis Submitted in Partial

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 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 information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix 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 information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

CIRCULAR COLOURING THE PLANE

CIRCULAR COLOURING THE PLANE CIRCULAR COLOURING THE PLANE MATT DEVOS, JAVAD EBRAHIMI, MOHAMMAD GHEBLEH, LUIS GODDYN, BOJAN MOHAR, AND REZA NASERASR Astrct. The unit distnce grph R is the grph with vertex set R 2 in which two vertices

More information

A negative answer to a question of Wilke on varieties of!-languages

A 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 information

Myhill-Nerode Theorem

Myhill-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 information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey 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 information

5.1 Properties of Inverse Trigonometric Functions.

5.1 Properties of Inverse Trigonometric Functions. Inverse Trignmetricl Functins The inverse f functin f( ) f ( ) f : A B eists if f is ne-ne nt ie, ijectin nd is given Cnsider the e functin with dmin R nd rnge [, ] Clerl this functin is nt ijectin nd

More information

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical

More information

Nil Elements and Even Square Rings

Nil Elements and Even Square Rings Interntionl Journl of Alger Vol. 7 no. - 7 HIKAI Ltd www.-hikri.co http://dx.doi.org/.988/ij.7.75 Nil Eleents nd Even Squre ings S. K. Pndey Deprtent of Mthetics Srdr Ptel University of Police Security

More information

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee

ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups. Sang Keun Lee Kngweon-Kyungki Mth. Jour. 10 (2002), No. 2, pp. 117 122 ON LEFT(RIGHT) SEMI-REGULAR AND g-reguar po-semigroups Sng Keun Lee Astrt. In this pper, we give some properties of left(right) semi-regulr nd g-regulr

More information

On-Line Construction. of Suffix Trees. Overview. Suffix Trees. Notations. goo. Suffix tries

On-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 information

AN ALTERNATE PROOF OF THE DE MOIVRE'S THEOREM

AN ALTERNATE PROOF OF THE DE MOIVRE'S THEOREM AN ALTERNATE PROOF OF THE DE MOIVRE'S THEOREM K.V. Vidysgr Deprtment of Mthemtics, Government Degree College, Nrsiptnm-536, Viskhptnm * Author for Correspondence ABSTRACT Trnsformtion is method for solving

More information

Linearly Similar Polynomials

Linearly Similar Polynomials Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

a n+2 a n+1 M n a 2 a 1. (2)

a n+2 a n+1 M n a 2 a 1. (2) Rel Anlysis Fll 004 Tke Home Finl Key 1. Suppose tht f is uniformly continuous on set S R nd {x n } is Cuchy sequence in S. Prove tht {f(x n )} is Cuchy sequence. (f is not ssumed to be continuous outside

More information

Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 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 information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 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 information

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Intuitionistic 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 information

Hamiltonian Cycle in Complete Multipartite Graphs

Hamiltonian Cycle in Complete Multipartite Graphs Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journl o Inequlities in Pure nd Applied Mthemtics http://jipm.vu.edu.u/ Volume 6, Issue 4, Article 6, 2005 MROMORPHIC UNCTION THAT SHARS ON SMALL UNCTION WITH ITS DRIVATIV QINCAI ZHAN SCHOOL O INORMATION

More information

Science and Technology RMUTT Journal

Science and Technology RMUTT Journal Science nd Technolog RMUTT Journl Vol7 No (017) : 00 05 wwwscirmuttcth/stj Online ISSN 9-1547 Possile Solutions of the Diophntine Eqution x Pinut Pungjump Deprtment of Mthemtics nd Sttistics, Fcult of

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

Math 61CM - Solutions to homework 9

Math 61CM - Solutions to homework 9 Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

More information

A Note on Conic Sections and Tangent Circles

A Note on Conic Sections and Tangent Circles Forum Geometricorum Volume 17 017 1 1. FORUM GEOM ISSN 153-1178 A Note on Conic Sections nd Tngent Circles Jn Kristin Huglnd Astrct. This rticle presents result on circles tngent to given conic section

More information

Designing finite automata II

Designing 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

Inner-product spaces

Inner-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 information

Quadratic Forms. Quadratic Forms

Quadratic 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 information

, if x 1 and f(x) = x, if x 0.

, if x 1 and f(x) = x, if x 0. Indin Institute of Informtion Technology Design nd Mnufcturing, Kncheepurm Chenni 600 7, Indi An Autonomous Institute under MHRD, Govt of Indi An Institute of Ntionl Importnce wwwiiitdmcin COM05T Discrete

More information

Summary: Method of Separation of Variables

Summary: Method of Separation of Variables Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section

More information

Introduction To Matrices MCV 4UI Assignment #1

Introduction 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 information

A proposition is a statement that can be either true (T) or false (F), (but not both).

A proposition is a statement that can be either true (T) or false (F), (but not both). 400 lecture nte #1 [Ch 2, 3] Lgic and Prfs 1.1 Prpsitins (Prpsitinal Lgic) A prpsitin is a statement that can be either true (T) r false (F), (but nt bth). "The earth is flat." -- F "March has 31 days."

More information

arxiv:math/ v2 [math.ho] 16 Dec 2003

arxiv:math/ v2 [math.ho] 16 Dec 2003 rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,

More information

Finite-State Automata: Recap

Finite-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 information

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω. Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd

More information

Chapter 3 Polynomials

Chapter 3 Polynomials Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling

More information

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!

Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them! PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For

More information

On the free product of ordered groups

On 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 information

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser Finite Autmata 2017/08/22 Chapter 1.1 in Sipser 1 Last time Thery f cmputatin Autmata Thery Cmputability Thery Cmplexity Thery Finite autmata Pushdwn autmata Turing machines 2 Outline fr tday Finite autmata

More information

The Algebra (al-jabr) of Matrices

The Algebra (al-jabr) of Matrices Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 + Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose

More information

Semigroup of generalized inverses of matrices

Semigroup of generalized inverses of matrices Semigroup of generlized inverses of mtrices Hnif Zekroui nd Sid Guedjib Abstrct. The pper is divided into two principl prts. In the first one, we give the set of generlized inverses of mtrix A structure

More information

STUDY GUIDE FOR BASIC EXAM

STUDY GUIDE FOR BASIC EXAM STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There

More information

INTRODUCTION TO LINEAR ALGEBRA

INTRODUCTION TO LINEAR ALGEBRA ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR AGEBRA Mtrices nd Vectors Prof. Dr. Bülent E. Pltin Spring Sections & / ME Applied Mthemtics for Mechnicl Engineers INTRODUCTION TO INEAR

More information

September 13 Homework Solutions

September 13 Homework Solutions College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

Lecture 19: Continuous Least Squares Approximation

Lecture 19: Continuous Least Squares Approximation Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for

More information

First Midterm Examination

First 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 information

(4.1) D r v(t) ω(t, v(t))

(4.1) D r v(t) ω(t, v(t)) 1.4. Differentil inequlities. Let D r denote the right hnd derivtive of function. If ω(t, u) is sclr function of the sclrs t, u in some open connected set Ω, we sy tht function v(t), t < b, is solution

More information

4.4 Areas, Integrals and Antiderivatives

4.4 Areas, Integrals and Antiderivatives . res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order

More information

Chapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1

Chapter 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 information

38 Riemann sums and existence of the definite integral.

38 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

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal 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 information

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,

More information

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), ) Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 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 information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Simple Gamma Rings With Involutions.

Simple Gamma Rings With Involutions. IOSR Journl of Mthemtics (IOSR-JM) ISSN: 2278-5728. Volume 4, Issue (Nov. - Dec. 2012), PP 40-48 Simple Gmm Rings With Involutions. 1 A.C. Pul nd 2 Md. Sbur Uddin 1 Deprtment of Mthemtics University of

More information

Admissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs

Admissibility 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 information

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson

A New Solution to the Intersection Problem of Mendelsohn Triple Systems. Rachel Watson A New Solution to the Intersection Prolem of Mendelsohn Triple Systems y Rchel Wtson A thesis sumitted to the Grdute Fculty of Auurn University in prtil fulfillment of the requirements for the Degree of

More information

Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonal Complement (pages ) Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

More information

Finite Field Arithmetic and Implementations. Xinmiao Zhang Case Western Reserve University

Finite Field Arithmetic and Implementations. Xinmiao Zhang Case Western Reserve University Finite Field Arithmetic nd Implementtions Xinmio Zhng Cse Western Reserve University Applictions of Finite Field Arithmetic Error-correcting codes Hmming codes BCH codes Reed-Solomon codes Low-density

More information

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT

ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT ON THE EXCEPTIONAL SET IN THE PROBLEM OF DIOPHANTUS AND DAVENPORT Andrej Dujell Deprtment of Mthemtics, University of Zgreb, 10000 Zgreb, CROATIA The Greek mthemticin Diophntus of Alexndri noted tht the

More information

Elements of Matrix Algebra

Elements of Matrix Algebra Elements of Mtrix Algebr Klus Neusser Kurt Schmidheiny September 30, 2015 Contents 1 Definitions 2 2 Mtrix opertions 3 3 Rnk of Mtrix 5 4 Specil Functions of Qudrtic Mtrices 6 4.1 Trce of Mtrix.........................

More information

CSCI FOUNDATIONS OF COMPUTER SCIENCE

CSCI FOUNDATIONS OF COMPUTER SCIENCE 1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

f t(y)dy f h(x)g(xy) dx fk 4 a. «..

f t(y)dy f h(x)g(xy) dx fk 4 a. «.. CERTAIN OPERATORS AND FOURIER TRANSFORMS ON L2 RICHARD R. GOLDBERG 1. Intrductin. A well knwn therem f Titchmarsh [2] states that if fel2(0, ) and if g is the Furier csine transfrm f/, then G(x)=x~1Jx0g(y)dy

More information

Torsion in Groups of Integral Triangles

Torsion in Groups of Integral Triangles Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,

More information

NOTE ON APPELL POLYNOMIALS

NOTE ON APPELL POLYNOMIALS NOTE ON APPELL POLYNOMIALS I. M. SHEFFER An interesting characterizatin f Appell plynmials by means f a Stieltjes integral has recently been given by Thrne. 1 We prpse t give a secnd such representatin,

More information

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION Fixed Point Theory, 13(2012), No. 1, 285-291 http://www.mth.ubbcluj.ro/ nodecj/sfptcj.html KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION FULI WANG AND FENG WANG School of Mthemtics nd

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

11.2. Infinite Series

11.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 information

MAKING DOUGHNUTS OF COHEN REALS

MAKING DOUGHNUTS OF COHEN REALS MAKING DUGHNUTS F CHEN REALS Lrenz Halbeisen Department f Pure Mathematics Queen s University Belfast Belfast BT7 1NN, Nrthern Ireland Email: halbeis@qub.ac.uk Abstract Fr a b ω with b \ a infinite, the

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann is the Mann! (But Lebesgue may besgue to differ.) Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

More information

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32

More information

More on automata. Michael George. March 24 April 7, 2014

More 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 information