The property where a string z is appended to two strings x and y, and one of the strings between xz and yz is in the language L and the other is not in the language L is called

Construct two PDA that recognizes the following language: 1. Every prefix contains at least as many a's as b's 2. The string contains the same number of a's and b's. Hint: To get the maximum number of points, use as few states and nonterminals as possible!

Write a program in C programming language that takes two arguments at the command line, both strings. The program checks to see whether or not the second string is a substring of the first (without using the substr -- or any other library -- function). One caveat: any * in the second string can match zero or more characters in the first string, so if the input were abcd and the substring was a*c, then it would count as a substring. Also, include functionality to allow an asterisk to be taken literally if preceded by a \, and a \ is taken literally except when preceding an asterisk.

Write the following function in Lisp: a function that takes one parameter that you can assume to be a symbol named after a day of the week (no need to check it), such as 'monday, and returns the symbol for the next day. For example, (next-day 'tuesday) should return the symbol 'wednesday. Implement this function with a complex conditional.

The following two languages over {0,1} L1: All strings that begin in '00' L2:  All strings that have the substring '1' embedded.

example code structure for how to reverse strings using ONLY C. eg; string 1 = ''i eat pie''. using REPLIT. (DO NOT USE C++, C# OR ANY OTHER LANGUAGE).

4- Write a C program to read an integer number num and find it's factorial. Note: the factorial number is all the number multiplied from 1 to the number itself. n! = n(n - 1)(n – 2) ... (2)(1) Example: 5! = (5)(4)(3)(2)(1) = 120