FSAs and Regular Expressions - Revision history

Mariana at 17:25, 1 September 2020

2020-09-01T17:25:07Z

@@ Line 96: / Line 96: @@
+|
 As described above, parentheses define a sub-expression. For example, the pattern H(ä|ae?)ndel  matches "Handel", "Händel", and "Haendel".
 |}

2020-09-01T17:24:11Z

@@ Line 308: / Line 308: @@
 or "011". That means that 1, 2, 4, and 6 match.
 -->
 = Video Resources =

2020-08-25T17:18:38Z

← Older revision		Revision as of 10:18, 25 August 2020
Line 357:		Line 357:
	'''\1''' is the number of the group that appears at the end of the string;		'''\1''' is the number of the group that appears at the end of the string;

	[a,e,i,o,u]{1,3} describes sequence of one to three vowels;		'''[a,e,i,o,u]{1,3}''' describes sequence of one to three vowels;

	\.* the character ‘.’ appears zero to more times;		'''\.*''' the character ‘.’ appears zero to more times;

	[b-df-hj-np-tv-z]+ a sequence of consonants, at least one consonant.		'''[b-df-hj-np-tv-z]+''' a sequence of consonants, at least one consonant.

2020-08-25T17:17:36Z

← Older revision		Revision as of 10:17, 25 August 2020
Line 347:		Line 347:
	3. Contain a sequence of at least one and at most 3 vowels, separated by zero or more characters '.' of a sequence consisting of at least one consonant.		3. Contain a sequence of at least one and at most 3 vowels, separated by zero or more characters '.' of a sequence consisting of at least one consonant.

	''Solution:''		'''Solution:'''

	The Regular Expression is:		The Regular Expression is:
	([a-z])[a,e,i,o,u]{1,3}\.*[b-df-hj-np-tv-z]+(\1)
	([a-z]) represents the group number 1 that captures the firs letter;		'''([a-z])[a,e,i,o,u]{1,3}\.*[b-df-hj-np-tv-z]+(\1)'''
	\1 is the number of the group that appears at the end of the string;
			'''([a-z])''' represents the group number 1 that captures the firs letter;

			'''\1''' is the number of the group that appears at the end of the string;

	[a,e,i,o,u]{1,3} describes sequence of one to three vowels;		[a,e,i,o,u]{1,3} describes sequence of one to three vowels;

	\.* the character ‘.’ appears zero to more times;		\.* the character ‘.’ appears zero to more times;

	[b-df-hj-np-tv-z]+ a sequence of consonants, at least one consonant.		[b-df-hj-np-tv-z]+ a sequence of consonants, at least one consonant.

2020-08-25T17:15:42Z

← Older revision		Revision as of 10:15, 25 August 2020
Line 338:		Line 338:

	==Problem 6==		==Problem 6==

	Write a regular expression describing a set of strings formed to the following rules:		Write a regular expression describing a set of strings formed to the following rules:

	1. Contain only lowercase letters of the English alphabet and the character '.';		1. Contain only lowercase letters of the English alphabet and the character '.';

	2. Start and end with the same letter;		2. Start and end with the same letter;

	3. Contain a sequence of at least one and at most 3 vowels, separated by zero or more characters '.' of a sequence consisting of at least one consonant.		3. Contain a sequence of at least one and at most 3 vowels, separated by zero or more characters '.' of a sequence consisting of at least one consonant.
	Solution:
			''Solution:''

	The Regular Expression is:		The Regular Expression is:
	([a-z])[a,e,i,o,u]{1,3}\.*[b-df-hj-np-tv-z]+(\1)		([a-z])[a,e,i,o,u]{1,3}\.*[b-df-hj-np-tv-z]+(\1)

2020-08-25T17:13:52Z

@@ Line 336: / Line 336: @@
 The strings that are represented by this pattern are 1, 4 and 6.
 ==Problem 6==
 = Video Resources =

2020-08-25T17:12:31Z

← Older revision		Revision as of 10:12, 25 August 2020
Line 336:		Line 336:

	The strings that are represented by this pattern are 1, 4 and 6.		The strings that are represented by this pattern are 1, 4 and 6.
			== Problem 6 ==

	==Problem 6==		==Problem 6==

2020-08-25T17:09:38Z

← Older revision		Revision as of 10:09, 25 August 2020
Line 336:		Line 336:

	The strings that are represented by this pattern are 1, 4 and 6.		The strings that are represented by this pattern are 1, 4 and 6.
			==Problem 6==

	= Video Resources =		= Video Resources =

2020-08-21T01:51:41Z

More useful patterns

← Older revision	Revision as of 18:51, 20 August 2020
(No difference)

2020-08-21T01:51:37Z

More useful patterns

← Older revision		Revision as of 18:51, 20 August 2020
Line 152:		Line 152:
	abc		abc
	\|-		\|-
	\|''' .*''' \|\| Matches any character (except for line terminators), ~~matchs~~ between zero and unlimited times.		\|''' .*''' \|\| Matches any character (except for line terminators), matches between zero and unlimited times.

	\|\| .*		\|\| .*