Question

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

score 2.4k · Answer 1 · 2025-01-02 12:43:15

2.4k

Views

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

Published on 02 January 2025 at 12:43

score 67 · Answer 2 · 2025-01-06 23:14:39

67

Views

Given a finite character vocabulary, what is the easiest way to represent arbitrarily long sequences of characters with uniform length?

Published on 06 January 2025 at 23:14

score 93 · Answer 3 · 2025-01-05 21:54:44

How to create a deterministic finite automata for the "regular" function where states lead to more than one state depending on the value of an int

score 75 · Answer 4 · 2025-01-05 21:36:40

75

Views

How do I set a pause between if statements?

Published on 05 January 2025 at 21:36

score 90 · Answer 5 · 2025-01-05 21:42:40

90

Views

Detect cyclic feeding interactions without applying XFST replace rules to lexicon

Published on 05 January 2025 at 21:42

score 82 · Answer 6 · 2025-01-05 21:38:48

82

Views

Understanding Lexicon FST in yesno example of Kaldi

Published on 05 January 2025 at 21:38

score 60 · Answer 7 · 2025-01-05 21:44:24

60

Views

How does placing the output (word) labels on the initial transitions of the words in an FST lead to effective composition?

Published on 05 January 2025 at 21:44

score 183 · Answer 8 · 2025-01-05 21:36:40

183

Views

How does forced alignment happen in Kaldi?

Published on 05 January 2025 at 21:36

score 52 · Answer 9 · 2025-01-05 21:44:06

52

Views

On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition

Published on 05 January 2025 at 21:44

score 150 · Answer 10 · 2025-01-05 21:35:30

150

Views

Finite state machine with timer resets

Published on 05 January 2025 at 21:35

score 345 · Answer 11 · 2025-01-05 21:43:03

345

Views

how to construct a dfa that recognizes the set of bit string that begins with two D's?

Published on 05 January 2025 at 21:43

score 386 · Answer 12 · 2025-01-05 21:34:44

386

Views

Automaton for prefix matching

Published on 05 January 2025 at 21:34

score 800 · Answer 13 · 2025-01-05 21:44:04

800

Views

Why does my screen not update when I click my button the first time, but works perfectly fine afterwards?

Published on 05 January 2025 at 21:44

score 152 · Answer 14 · 2025-01-07 02:02:46

152

Views

Generate output based on first character of a word

Published on 07 January 2025 at 02:02

score 848 · Answer 15 · 2025-01-05 21:39:40

848

Views

Is this NFA correctly accepting inputs that end with a 00?

Published on 05 January 2025 at 21:39

score 1.5k · Answer 16 · 2025-01-05 21:42:39

1.5k

Views

npda for the language number a's less than or equal to 3 times the number of b's

Published on 05 January 2025 at 21:42

score 325 · Answer 17 · 2025-01-06 14:54:52

325

Views

Game Ai using Enum as Finite State Machine

Published on 06 January 2025 at 14:54

score 2k · Answer 18 · 2025-01-05 21:39:40

2k

Views

How to convert regular expression to finite state machine?

Published on 05 January 2025 at 21:39

score 2.2k · Answer 19 · 2025-01-05 21:35:08

2.2k

Views

How to find the language of a NFA

Published on 05 January 2025 at 21:35

score 228 · Answer 20 · 2025-01-07 11:48:54

228

Views

Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible

Published on 07 January 2025 at 11:48

List Question

Designing a DFA (alphabet 'a' and 'b') : The number of 'a' in the string must be a multiple of 3, and the string does not contain 'aba'

Given a finite character vocabulary, what is the easiest way to represent arbitrarily long sequences of characters with uniform length?

How to create a deterministic finite automata for the "regular" function where states lead to more than one state depending on the value of an int

How do I set a pause between if statements?

Detect cyclic feeding interactions without applying XFST replace rules to lexicon

Understanding Lexicon FST in yesno example of Kaldi

How does placing the output (word) labels on the initial transitions of the words in an FST lead to effective composition?

How does forced alignment happen in Kaldi?

On the use of subsequential symbol $ in Finite state transducers to pad out the context, for composition

Finite state machine with timer resets

how to construct a dfa that recognizes the set of bit string that begins with two D's?

Automaton for prefix matching

Why does my screen not update when I click my button the first time, but works perfectly fine afterwards?

Generate output based on first character of a word

Is this NFA correctly accepting inputs that end with a 00?

npda for the language number a's less than or equal to 3 times the number of b's

Game Ai using Enum as Finite State Machine

How to convert regular expression to finite state machine?

How to find the language of a NFA

Draw an FSA that recognizes: (A∗ | AB+). (The bar outscopes the other operators, so its equal to: (A∗) | (AB+).) Use as few states possible

Trending Questions

Popular # Hahtags

Popular Questions