edited by
679 views
1 votes
1 votes
Consider an alphabet $\Sigma = \{1, 2, 3\}.$ Design a deterministic finite-state automaton (DFA) that accepts all strings in $\Sigma^*$ in which the digits appear in non-decreasing sequence, from left to right. For example, the string $1123$ and $222$ would be accepted, whereas $21333$ will not be accepted.
edited by

1 Answer

2 votes
2 votes

Dead state is not final state and is represented by single circle

 

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Sep 20, 2018
394 views
Write a complete ANSI C code using recursion to calculate the $sum(s)$ of the digits of an integer number (i) consisting of maximum 5 digits. For example, (1) = if $i=123...
1 votes
1 votes
1 answer
2
1 votes
1 votes
1 answer
3
go_editor asked Sep 20, 2018
1,583 views
An operating system contains three resource classes. The number of resource units in these classes are $7, 7\ \text{and} \ 10$ respectively. The current resource allocati...
1 votes
1 votes
1 answer
4
go_editor asked Sep 20, 2018
426 views
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.