Given segment of code:

$string1 = "Hello\nWorld\n";

if ($string1 =$\sim$m/d\n\z/) {

  print "$string1 is a string ";

  print "that ends with 'd\\n'.\n";

}

What does the symbol /z does?

What does the following segment of code output?

$string1 = "Hello World\n";

if ($string1 =~ m/(H..).(l..)/) {

  print "We matched '$1' and '$2'.\n";

}

Which of the following cannot be used to decide whether and how a given regexp matches a string:

Which of the following are not quantifiers?

Arden’s theorem is true for:

What the following DFA accepts?

A DFA cannot be represented in the following format

Which of the following not an example Bounded Information?

A Language for which no DFA exist is a________

For the following change of state in FA, which of the following codes is an incorrect option?

if char = “0” goto n;

Which of the following is a not a part of 5-tuple finite automata?

The minimum number of states required to recognize an octal number divisible by 3 are/is

RR* can be expressed in which of the forms:

The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

Statement 1: A Finite automata can be represented graphically;

Statement 2: The nodes can be its states;

Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?