simplify 3/16+13/16÷39/15÷4/3
Answers
Every language defined by a regular expression is also defined by a finite automaton. Find a regular expression by using Arden's Theorem consisting of all strings over {0, 1} starting with any number of 0's, followed by one or more 1's, followed by one or more 0's, followed by a single 1, followed by any number of 0's, followed by 1 and ending in any string of 0's and 1'sEvery language defined by a regular expression is also defined by a finite automaton. Find a regular expression by using Arden's Theorem consisting of all strings over {0, 1} starting with any number of 0's, followed by one or more 1's, followed by one or more 0's, followed by a single 1, followed by any number of 0's, followed by 1 and ending in any string of 0's and 1'sEvery language defined by a regular expression is also defined by a finite automaton. Find a regular expression by using Arden's Theorem consisting of all strings over {0, 1} starting with any number of 0's, followed by one or more 1's, followed by one or more 0's, followed by a single 1, followed by any number of 0's, followed by 1 and ending in any string of 0's and 1'sEvery language defined by a regular expression is also defined by a finite automaton. Find a regular expression by using Arden's Theorem consisting of all strings over {0, 1} starting with any number of 0's, followed by one or more 1's, followed by one or more 0's, followed by a single 1, followed by any number of 0's, followed by 1 and ending in any string of 0's and 1's
Answer:
15/52
Step-by-step explanation:
{(3/16+13/16) ÷(39/15)} ÷(4/3)
{(16/16) ×(15/39)} ×(3/4)
15/39 × 3/4
45/156
15/52