Skip to main content
Computer Science

Return to Question

replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
Source Link
Community Bot
Community Bot
  • 1

My question in response to this answerthis answer: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

My question in response to this answer: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

My question in response to this answer: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

deleted 269 characters in body; edited tags; edited title
Source Link
Raphael
Raphael
  • 72.9k
  • 30
  • 181
  • 393

DFAs representing these Automata for languages derived from an automaton by number of state visits

My question is in response to this answer: http://cs.stackexchange.com/a/18614/22902this answer.

I'm not completely sure about the etiquette about asking questions regarding year-old answers, but I'm assuming I am following protocol by creating a new question. If I am incorrect, please inform me.

My question is: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

  • what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

Thank you in advance for any help.

DFAs representing these languages

My question is in response to this answer: http://cs.stackexchange.com/a/18614/22902.

I'm not completely sure about the etiquette about asking questions regarding year-old answers, but I'm assuming I am following protocol by creating a new question. If I am incorrect, please inform me.

My question is:

  • what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

Thank you in advance for any help.

Automata for languages derived from an automaton by number of state visits

My question in response to this answer: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

Fixed erroneous shift of L indices; Listed questions and definitions to reach 6 chars treshold
Source Link
edit approved Jan 12, 2015 at 15:15
PLNech
edit approved Jan 12, 2015 at 15:15
PLNech
  • 103
  • 2

My question is in response to this answer: http://cs.stackexchange.com/a/18614/22902.

I'm not completely sure about the etiquette about asking questions regarding year-old answers, but I'm assuming I am following protocol by creating a new question. If I am incorrect, please inform me.

My question is: what would the finite automata look like for $L_1$ and $L_0$ in the answer?

  • what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_1$$L_0$ and $L_2$$L_1$?

Definitions:

$L$ = infinite regular language

$q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

$L_1$ = {w in A | $q$ is visited an odd number of times}

$L_0$ = {w in A | $q$ is visited an even number of times}

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

Thank you in advance for any help.

My question is in response to this answer: http://cs.stackexchange.com/a/18614/22902.

I'm not completely sure about the etiquette about asking questions regarding year-old answers, but I'm assuming I am following protocol by creating a new question. If I am incorrect, please inform me.

My question is: what would the finite automata look like for $L_1$ and $L_0$ in the answer? I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_1$ and $L_2$?

Definitions:

$L$ = infinite regular language

$q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

$L_1$ = {w in A | $q$ is visited an odd number of times}

$L_0$ = {w in A | $q$ is visited an even number of times}

Thank you in advance for any help.

My question is in response to this answer: http://cs.stackexchange.com/a/18614/22902.

I'm not completely sure about the etiquette about asking questions regarding year-old answers, but I'm assuming I am following protocol by creating a new question. If I am incorrect, please inform me.

My question is:

  • what would the finite automata look like for $L_1$ and $L_0$ in the answer?

I get how the languages are formed; however, since $M_L$ cannot remember how many times it has looped, how does $q$ branch off (if it does) into the two different DFAs for $L_0$ and $L_1$?

Definitions:

  • $L$ = infinite regular language

  • $q$ = state within the DFA for $L$, $M_L$, where $M_L$ loops

  • $L_1$ = {w in A | $q$ is visited an odd number of times}

  • $L_0$ = {w in A | $q$ is visited an even number of times}

Thank you in advance for any help.

Tweeted twitter.com/#!/StackCompSci/status/544180160376078336
Changed $L_1$ and $L_2$ to $L_1$ and $L_0$, added definitions for the languages
Source Link
tdark
tdark
  • 155
  • 6
Source Link
tdark
tdark
  • 155
  • 6