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.3k · Answer 1 · 2017-01-01 14:31:47

2.3k

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 01 January 2017 at 14:31

score 24 · Answer 2 · 2021-04-19 00:42:02

24

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 57 · Answer 3 · 2023-01-18 02:30:04

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 29 · Answer 4 · 2022-03-10 13:21:51

29

Views

How do I set a pause between if statements?

Published on 10 March 2022 at 13:21

score 42 · Answer 5 · 2021-10-13 22:58:37

42

Views

Detect cyclic feeding interactions without applying XFST replace rules to lexicon

Published on 13 October 2021 at 22:58

score 45 · Answer 6 · 2023-07-11 06:09:32

45

Views

Understanding Lexicon FST in yesno example of Kaldi

Published on 11 July 2023 at 06:09

score 20 · Answer 7 · 2023-07-10 06:11:45

20

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 139 · Answer 8 · 2023-07-11 04:20:19

139

Views

How does forced alignment happen in Kaldi?

Published on 11 July 2023 at 04:20

score 13 · Answer 9 · 2023-07-10 16:09:18

13

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 104 · Answer 10 · 2023-07-26 22:35:49

104

Views

Finite state machine with timer resets

Published on 26 July 2023 at 22:35

score 333 · Answer 11 · 2019-08-27 06:00:57

333

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 373 · Answer 12 · 2017-02-11 13:36:27

373

Views

Automaton for prefix matching

Published on 11 February 2017 at 13:36

score 788 · Answer 13 · 2019-05-01 02:29:36

788

Views

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

Published on 01 May 2019 at 02:29

score 107 · Answer 14 · 2021-07-13 12:27:01

107

Views

Generate output based on first character of a word

Published on 13 July 2021 at 12:27

score 833 · Answer 15 · 2021-01-12 09:12:15

833

Views

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

Published on 12 January 2021 at 09:12

score 1.5k · Answer 16 · 2016-11-11 15:49:10

1.5k

Views

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

Published on 11 November 2016 at 15:49

score 310 · Answer 17 · 2019-01-25 12:58:31

310

Views

Game Ai using Enum as Finite State Machine

Published on 25 January 2019 at 12:58

score 2k · Answer 18 · 2016-12-08 11:45:45

2k

Views

How to convert regular expression to finite state machine?

Published on 08 December 2016 at 11:45

score 2.2k · Answer 19 · 2020-03-01 16:27:32

2.2k

Views

How to find the language of a NFA

Published on 01 March 2020 at 16:27

score 212 · Answer 20 · 2022-02-14 23:13:11

212

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

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