Question

How does the record assembly work in dremel?

score 29 · Answer 1 · 2024-01-19T10:06:55.697000

29

Views

How does the record assembly work in dremel?

Published on 19 January 2024 at 10:06

score 39 · Answer 2 · 2023-08-17T12:12:49.263000

39

Views

How to create a singleton in Python that always replaces the previous instance?

Published on 17 August 2023 at 12:12

score 166 · Answer 3 · 2023-07-26T22:35:49.293000

166

Views

Finite state machine with timer resets

Published on 26 July 2023 at 22:35

score 106 · Answer 4 · 2023-07-11T06:09:32.187000

106

Views

Understanding Lexicon FST in yesno example of Kaldi

Published on 11 July 2023 at 06:09

score 203 · Answer 5 · 2023-07-11T04:20:19.483000

203

Views

How does forced alignment happen in Kaldi?

Published on 11 July 2023 at 04:20

score 79 · Answer 6 · 2023-07-10T16:09:18.907000

79

Views

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

Published on 10 July 2023 at 16:09

score 65 · Answer 7 · 2023-07-10T06:11:45.703000

65

Views

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

Published on 10 July 2023 at 06:11

score 118 · Answer 8 · 2023-01-18T02:30:04.987000

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 284 · Answer 9 · 2022-09-23T06:51:03.403000

284

Views

How to simplify/generalize a Finite State Machine (FSM) for a vending machine?

Published on 23 September 2022 at 06:51

score 197 · Answer 10 · 2022-09-18T15:58:55.363000

197

Views

Aligning nodes in dot with group does not give the desired result

Published on 18 September 2022 at 15:58

score 80 · Answer 11 · 2022-03-10T13:21:51.943000

80

Views

How do I set a pause between if statements?

Published on 10 March 2022 at 13:21

score 245 · Answer 12 · 2022-02-14T23:13:11.730000

245

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 14 February 2022 at 23:13

score 115 · Answer 13 · 2021-10-13T22:58:37.090000

115

Views

Detect cyclic feeding interactions without applying XFST replace rules to lexicon

Published on 13 October 2021 at 22:58

score 167 · Answer 14 · 2021-07-13T12:27:01.803000

167

Views

Generate output based on first character of a word

Published on 13 July 2021 at 12:27

score 89 · Answer 15 · 2021-04-19T00:42:02.070000

89

Views

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

Published on 19 April 2021 at 00:42

score 864 · Answer 16 · 2021-01-12T09:12:15.950000

864

Views

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

Published on 12 January 2021 at 09:12

score 2.2k · Answer 17 · 2020-03-01T16:27:32.887000

2.2k

Views

How to find the language of a NFA

Published on 01 March 2020 at 16:27

score 377 · Answer 18 · 2019-08-27T06:00:57.887000

377

Views

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

Published on 27 August 2019 at 06:00

score 161 · Answer 19 · 2019-05-30T08:45:13.003000

161

Views

Pumping Lemma for regular language: Can we modify the first condition to 'for each i > 0'?

Published on 30 May 2019 at 08:45

score 227 · Answer 20 · 2019-05-28T11:58:36.283000

227

Views

Is the pumping lemma proof wrong from book <Introduction to the Theory of Computation>?

Published on 28 May 2019 at 11:58

List Question

How does the record assembly work in dremel?

How to create a singleton in Python that always replaces the previous instance?

Finite state machine with timer resets

Understanding Lexicon FST in yesno example of Kaldi

How does forced alignment happen in Kaldi?

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

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

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 to simplify/generalize a Finite State Machine (FSM) for a vending machine?

Aligning nodes in dot with group does not give the desired result

How do I set a pause between if statements?

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

Detect cyclic feeding interactions without applying XFST replace rules to lexicon

Generate output based on first character of a word

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

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

How to find the language of a NFA

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

Pumping Lemma for regular language: Can we modify the first condition to 'for each i > 0'?

Is the pumping lemma proof wrong from book <Introduction to the Theory of Computation>?

Trending Questions

Popular # Hahtags

Popular Questions