See here for basic rules on problem.
Problem #2
Make an optimal machine that accepts any letter combination that begins with a consonant and alternates vowel consonant from then on. ("Y" is considered both vowel and consonant)
$\begingroup$
$\endgroup$
1
-
$\begingroup$ Is mathematics as tag ok? It's more Informatics $\endgroup$– user52327Commented Nov 14, 2018 at 14:45
Add a comment
|
7 Answers
$\begingroup$
$\endgroup$
13
This is my answer :)
Vowel: A,E,I,O,U,Y
Consonant: B,C,D,F,G,H,J,K,L,M,N,P,Q,R,S,T,V,W,X,Y,Z
Original Edits:
...
-
$\begingroup$ I thought of that too, but can an input/output diagram have two ends? $\endgroup$ Commented Nov 14, 2018 at 11:45
-
$\begingroup$ @OmegaKrypton I'm not absolutely sure but I rather think you can have 2 ends :) $\endgroup$– user52327Commented Nov 14, 2018 at 11:48
-
$\begingroup$ This diagram fails if the string is a single "Y". Should Y be also listed in the consonants? Thanks $\endgroup$ Commented Nov 14, 2018 at 11:48
-
$\begingroup$ You don't need a point for fail, you just need a Start and any sequence that doesn't end on a red dotted circle fails. Also yes you can have multiple ends. $\endgroup$ Commented Nov 14, 2018 at 11:48
-
7$\begingroup$ It also accepts an empty string, but an empty string does not begin with a consonant. $\endgroup$ Commented Nov 14, 2018 at 12:09
$\begingroup$
$\endgroup$
5
Can I have:
$\oplus\xrightarrow{consonant}\color{red}\bullet\xrightarrow{\;\;vowel\;\;}\color{red}\bullet$
$\qquad\qquad\quad\,\mid\qquad\qquad\mid$
$\qquad\qquad\quad\,\xleftarrow{\;consonant\;}$
-
$\begingroup$ Not correct if the sequence ends with a vowel. $\endgroup$ Commented Nov 14, 2018 at 12:31
-
$\begingroup$ @BenFranks; oh right, so is this any better? $\endgroup$– JMPCommented Nov 14, 2018 at 12:35
-
$\begingroup$ it is correct now but can be optimised. Remember the start can be an end. $\endgroup$ Commented Nov 14, 2018 at 12:38
-
$\begingroup$ like this? I did move the \oplus to the last red, but this accepts an empty string, which I feel is cheating $\endgroup$– JMPCommented Nov 14, 2018 at 12:41
-
1
$\begingroup$
$\endgroup$
7
I think it is following since its not specified that if it should end on vowel or consonant.
If the failed state is must,
If it should alternate and end on consonant then:
-
$\begingroup$ It shall alternate ... this is not correct $\endgroup$– user52327Commented Nov 14, 2018 at 11:53
-
$\begingroup$ @Jannis I have edited my answer please check $\endgroup$ Commented Nov 14, 2018 at 11:55
-
$\begingroup$ It shall not end on an consonant ... read the question again $\endgroup$– user52327Commented Nov 14, 2018 at 11:55
-
1$\begingroup$ @Jannis where is that in the question? $\endgroup$ Commented Nov 14, 2018 at 11:56
-
$\begingroup$ Nowhere stands sth about how to end the chain ... $\endgroup$– user52327Commented Nov 14, 2018 at 11:57
$\begingroup$
$\endgroup$
My solution has 5 nodes.
(EDIT: I made it too complicated, and a 3-node solution is possible. I'm leaving this answer as-is, because it works and is interesting.)
Note that the Consonant and Vowel labels in the picture exclude Y, e.g. Vowel means AEIOU only.
It does not accept an empty string.
It accepts a string of Y's.
It accepts a string starting with any even number of Y's only if it is followed by a consonant, but not if it is followed by a vowel.
It accepts a string starting with any odd number of Y's only if it is followed by a vowel, but not if it is followed by a consonant.
The left two nodes of the square deal with any Y prefixes. The right two nodes are used once a non-Y has been seen. I needed the extra starting node in order to disallow an empty string, since the question says the string must begin with a consonant.
answered Nov 14, 2018 at 12:01
$\begingroup$
$\endgroup$
2
Pen-and-paper solution... doop de doo.
-
$\begingroup$ Your solution would accept a sequence that begins with a vowel which breaks one of the requirements. $\endgroup$ Commented Nov 14, 2018 at 11:53
-
$\begingroup$
$\endgroup$
1
My attempt:
I don't know if the "But not Y" part is neccessary, but here goes
$\begingroup$
$\endgroup$
You can shape it like a triangle. 3 way solution. This assumes what Y is both consonant and vowel, basiclly it cycles between Start and the node O until the rule is broken.
c c
---> --->
Start O Fail
<--- --->
a a
