Question

Regular expression for a language that emphasises ordering

score 36 · Answer 1 · 2026-03-27 22:59:24

36

Views

Regular expression for a language that emphasises ordering

Published on 27 Mar 2026 - 22:59

score 80 · Answer 2 · 2026-04-01 20:00:04

80

Views

Every language is contained in a regular language

Published on 01 Apr 2026 - 20:00

score 97 · Answer 3 · 2026-03-26 18:50:42

97

Views

class of languages strongly recognized by nondeterministic automata coincides with the class of regular languages

Published on 26 Mar 2026 - 18:50

score 1.2k · Answer 4 · 2026-04-01 21:54:29

1.2k

Views

Proving intersection of two regular languages is regular with Myhill Nerode

Published on 01 Apr 2026 - 21:54

score 70 · Answer 5 · 2017-11-01 08:36:59

70

Views

What is the computational complexity for regular languages?

Published on 01 Nov 2017 - 8:36

score 270 · Answer 6 · 2026-02-23 06:24:24

270

Views

if $R \equiv RR$, then $R \equiv \emptyset$ or $\epsilon \in L(R)$

Published on 23 Feb 2026 - 6:24

score 226 · Answer 7 · 2026-03-29 06:30:09

226

Views

Turing machines with read-only stack and two stacks

Published on 29 Mar 2026 - 6:30

score 434 · Answer 8 · 2026-03-29 06:30:21

434

Views

How can we define the terms "computable" and "partially computable" for functions like $f:\mathbb N^k \to \mathbb N^m$

Published on 29 Mar 2026 - 6:30

score 60 · Answer 9 · 2026-03-29 08:13:36

60

Views

Turing Machine - automata

Published on 29 Mar 2026 - 8:13

score 858 · Answer 10 · 2026-03-27 23:01:29

858

Views

How to prove that this language is not regular?

Published on 27 Mar 2026 - 23:01

score 433 · Answer 11 · 2026-03-27 22:55:22

433

Views

Can we convert an NFA to a regular expression of polynomial length?

Published on 27 Mar 2026 - 22:55

score 426 · Answer 12 · 2026-04-01 21:55:17

426

Views

If a language is regular, then must it also be a DPDA?

Published on 01 Apr 2026 - 21:55

score 40 · Answer 13 · 2017-11-21 18:20:32

40

Views

Logic - Having a alphabet and a set of words from that language,is it true that there exists a regular expression

Published on 21 Nov 2017 - 18:20

score 738 · Answer 14 · 2026-03-29 08:14:52

738

Views

How many variables can a standard Turing Machine write?

Published on 29 Mar 2026 - 8:14

score 375 · Answer 15 · 2026-03-26 18:50:41

375

Views

Find a language L with Rank(L)=k such that Rank($L^R$)>$2^{(k+1)}$

Published on 26 Mar 2026 - 18:50

List Question

Regular expression for a language that emphasises ordering

Every language is contained in a regular language

class of languages strongly recognized by nondeterministic automata coincides with the class of regular languages

Proving intersection of two regular languages is regular with Myhill Nerode

What is the computational complexity for regular languages?

if $R \equiv RR$, then $R \equiv \emptyset$ or $\epsilon \in L(R)$

Turing machines with read-only stack and two stacks

How can we define the terms "computable" and "partially computable" for functions like $f:\mathbb N^k \to \mathbb N^m$

Turing Machine - automata

How to prove that this language is not regular?

Can we convert an NFA to a regular expression of polynomial length?

If a language is regular, then must it also be a DPDA?

Logic - Having a alphabet and a set of words from that language,is it true that there exists a regular expression

How many variables can a standard Turing Machine write?

Find a language L with Rank(L)=k such that Rank($L^R$)>$2^{(k+1)}$

Trending Questions

Popular # Hahtags

Popular Questions