Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Daniel Martin's user avatar
Daniel Martin's user avatar
Daniel Martin's user avatar
Daniel Martin
  • Member for 9 years, 3 months
  • Last seen more than a month ago
8 votes

Find a regular language that is "infinitely between" two other regular languages

6 votes

Regular languages that seem irregular

3 votes
Accepted

Getting a tighter upper bound on the following function

3 votes
Accepted

Expected value of the distance between nodes in a binary tree

2 votes

Is there a DFA that accepts no string, but has at least one final state?

2 votes

Use of Myhill-Nerode Theorem to prove minimal number of states

2 votes
Accepted

Designing a DFA for binary strings having 1 as the fourth character from the end

2 votes
Accepted

Can a machine choose whether or not to accept a state in a FSM

1 vote
Accepted

Why some Huffman codes have efficiency better than others?

1 vote

Prove or disprove L is regular

1 vote

Proving/Disproving that language L is non-regular/CFL

1 vote

Doubt in definition of Float

1 vote

An algorithm for comparing a DFA and a regular expression

1 vote

No FSM/Regex exists for this language right?

0 votes

Finding a regular expression for all non-empty binary strings that contain both 0s and 1s but no consecutive 1s

0 votes

Formal algorithm to test whether two given regular expressions define equal/identical or unequal languages