Register

Octal no.

718 views

1 Answer

3 votes
3 votes
0(digit)* octal number regular expression
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
sh!va asked Jul 13, 2016
900 views
Equivalent number of digits in octal system
If a number requires 6 hexadecimal digits for its representation, what is the minimum number of octal digits required to represent it ? (A) 6 (B)7 (C) 8 (D) 9
If a number requires 6 hexadecimal digits for its representation, what is the minimum number of octal digits required to represent it ?(A) 6(B)7(C) 8(D) 9
User Avatar
1 votes
1 votes
2 answers
2
sh!va asked Jul 12, 2016
3,604 views
Which is a valid octal constant?
The valid octal constants from the following (i) 0245 (ii) 0387 (iii) 04.32 (iv) –0467 (A) (i) and (ii) (B) (iii) and (iv) (C) (i) (iii) and (iv) (D) (i) and (iv)
The valid octal constants from the following(i) 0245 (ii) 0387 (iii) 04.32 (iv) –0467(A) (i) and (ii)(B) (iii) and (iv)(C) (i) (iii) and (iv)(D) (i) and (iv)
User Avatar
0 votes
0 votes
0 answers
3
admin asked Oct 17, 2019
402 views
Michael Sipser Edition 3 Exercise 4 Question 22 (Page No. 212)
Let $PREFIX-FREE_{REX} = \{\langle R \rangle \mid \text{R is a regular expression and L(R) is prefix-free}\}$. Show that $PREFIX FREE_{REX}$ is decidable. Why does a similar approach fail to show that $PREFIX-FREE_{CFG}$ is decidable?
Let $PREFIX-FREE_{REX} = \{\langle R \rangle \mid \text{R is a regular expression and L(R) is prefix-free}\}$. Show that $PREFIX FREE_{REX}$ is decidable. Why does a simi...
User Avatar
0 votes
0 votes
0 answers
4
admin asked Oct 15, 2019
522 views
Michael Sipser Edition 3 Exercise 4 Question 2 (Page No. 211)
Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.
Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.
User Avatar
Link Copied!