666 views

2 Answers

Position:
Show:

Related questions

0 0 votes
0 0 answers
143
143 views
kakorot asked May 30
143 views
1 1 vote
1 answers 1 answer
258
258 views
Shahd_Algahim asked Dec 6, 2025
258 views
For Σ = {a, b} construct dfa’s that accept the sets consisting of “all strings with an even number of a’s” (give transition diagram of the finite machine)
0 0 votes
0 0 answers
356
356 views
Amarnath Jagatap asked Feb 26, 2025
356 views
A run in a string is a substring of length at least two, as long as possible and consisting entirely of the same symbol. For instance, the string abbbaab contains a run o...
3 3 votes
0 0 answers
379
379 views
Deepak Poonia asked Nov 20, 2024
379 views
Show that $L = \{a^nb^m,n< 2m \}$ is a deterministic context-free language.