- Consider the finite-state automaton A with input alphabet {a, b} given
by the following transition diagram:
s0 s1 s2 s3
b
a
b
a
b
a
a, b
(a) Is the empty string accepted by this automaton?
(b) Find three strings that are not accepted by this automaton.
(c) Find three strings that are accepted by this automaton.
(d) What is the language recognised by A? Describe the language
using either set-builder notation or a regular expression. - For each of the following languages, construct a corresponding finitestate automaton with input alphabet {a, b} that recognises the language.
(a) L = {w ∈ {a, b}
∗
| |w|a ≤ 2}, i.e. the set of all strings with at
most 2 occurrences of a.
(b) L = {awb | w ∈ {a, b}
∗
}. - There are three specifications for a graph listed below. For each of
these specifications give either an example of a graph that satisfies
the specification, or a formal argument why no such graph exists.
(a) A graph with 4 vertices 7 edges and an Euler circuit.
(b) A full binary tree with 8 vertices and total degree 14.
(c) A simple connected graph with a circuit.
1
Our Free Services
Paper Formatting
- Double or single-spaced
- 1-inch margin
- 12 Font Arial or Times New Roman
- 300 words per page
No Lateness!
Our orders are delivered strictly on time without delay
Our Guarantees
- Free Unlimited revisions
- Guaranteed Privacy
- Money Return guarantee
- Plagiarism Free Writing
Finite-state automaton
Our Services
- Research Paper Writing
- Essay Writing
- Dissertation Writing
- Thesis Writing
Daily Statistics
- 134 New Projects
- 235 Projects in Progress
- 432 Inquiries
- 624 Repeat clients
Why Choose Us
- Money Return guarantee
- Guaranteed Privacy
- Written by Professionals
- Paper Written from Scratch
- Timely Deliveries
- Free Amendments