Question

Shunting yard algorithm for parsing basic regular expressions with the Kleene star

score 132 · Answer 1 · 2023-11-14T09:35:16.200000

132

Views

Shunting yard algorithm for parsing basic regular expressions with the Kleene star

Published on 14 November 2023 at 09:35

score 49 · Answer 2 · 2023-07-14T13:57:06.917000

49

Views

How do the kleene plus operators apply here?

Published on 14 July 2023 at 13:57

score 1.4k · Answer 3 · 2022-05-06T10:35:33.423000

1.4k

Views

How to apply Kleene star on automata?

Published on 06 May 2022 at 10:35

score 221 · Answer 4 · 2021-10-02T10:03:26.087000

221

Views

Order in Kleene star operation?

Published on 02 October 2021 at 10:03

score 327 · Answer 5 · 2021-07-07T13:54:54.473000

327

Views

Using PCRE2 regex with repeating groups to find email addresses

Published on 07 July 2021 at 13:54

score 847 · Answer 6 · 2021-02-10T22:38:04.193000

847

Views

A DFA for Kleene star operation

Published on 10 February 2021 at 22:38

score 623 · Answer 7 · 2020-10-14T09:00:59.337000

623

Views

Regex allow asterisk(*) only once time and in the end

Published on 14 October 2020 at 09:00

score 385 · Answer 8 · 2020-05-21T15:20:21.580000

385

Views

Implementing Kleene star operator * (sort of) in C program

Published on 21 May 2020 at 15:20

score 359 · Answer 9 · 2018-11-14T01:56:31.593000

359

Views

How to use a kleene star operator (*) or it's variant (+) with variables in sparql?

Published on 14 November 2018 at 01:56

score 146 · Answer 10 · 2018-10-06T22:58:23.900000

146

Views

Kleene star semantics and set comparison

Published on 06 October 2018 at 22:58

score 522 · Answer 11 · 2018-09-28T10:22:05.193000

522

Views

String length after kleen's closure in finite-autometa theory

Published on 28 September 2018 at 10:22

score 60 · Answer 12 · 2018-03-20T12:50:47.123000

60

Views

Does the kleene-star's potence 0 fulfill a disjunction?

Published on 20 March 2018 at 12:50

score 437 · Answer 13 · 2017-03-12T12:36:40.283000

437

Views

Best way to implement Kleene star operation in Java

Published on 12 March 2017 at 12:36

score 1.2k · Answer 14 · 2017-01-01T15:15:08.330000

1.2k

Views

Why can't the Kleene closure construction for an NFA be simplified?

Published on 01 January 2017 at 15:15

score 8.4k · Answer 15 · 2016-01-24T01:48:11.833000

8.4k

Views

Deterministic Finite Automaton of Kleene Star

Published on 24 January 2016 at 01:48

score 14.8k · Answer 16 · 2015-10-16T16:30:47.750000

14.8k

Views

Automata Regular expression - difference between concatenation & union

Published on 16 October 2015 at 16:30

score 5.5k · Answer 17 · 2015-10-15T05:51:47.067000

5.5k

Views

If language L is not regular, is L* regular?

Published on 15 October 2015 at 05:51

score 2.3k · Answer 18 · 2015-09-02T17:29:54.270000

2.3k

Views

Show that two regular expressions are equivalent in Automata Theory without using DFAs

Published on 02 September 2015 at 17:29

score 883 · Answer 19 · 2015-08-28T23:09:47.967000

883

Views

Cannot understand Kleene Star paper

Published on 28 August 2015 at 23:09

score 1k · Answer 20 · 2015-08-26T20:30:10.120000

1k

Views

Need help about recursive definition for two languages S* and T* where S={aa,b} and T={w1,w2,w3,w4}

Published on 26 August 2015 at 20:30

List Question

Shunting yard algorithm for parsing basic regular expressions with the Kleene star

How do the kleene plus operators apply here?

How to apply Kleene star on automata?

Order in Kleene star operation?

Using PCRE2 regex with repeating groups to find email addresses

A DFA for Kleene star operation

Regex allow asterisk(*) only once time and in the end

Implementing Kleene star operator * (sort of) in C program

How to use a kleene star operator (*) or it's variant (+) with variables in sparql?

Kleene star semantics and set comparison

String length after kleen's closure in finite-autometa theory

Does the kleene-star's potence 0 fulfill a disjunction?

Best way to implement Kleene star operation in Java

Why can't the Kleene closure construction for an NFA be simplified?

Deterministic Finite Automaton of Kleene Star

Automata Regular expression - difference between concatenation & union

If language L is not regular, is L* regular?

Show that two regular expressions are equivalent in Automata Theory without using DFAs

Cannot understand Kleene Star paper

Need help about recursive definition for two languages S* and T* where S={aa,b} and T={w1,w2,w3,w4}

Trending Questions

Popular # Hahtags

Popular Questions