Network profile

Roger Costello

Reputation

361

361
321
281

2018
2019
2020
2021

Top tag

formal-grammars

Next privilege

500 Rep.

Access review queues

Badges

2

9

Newest

Nice Question

Next badge

0/1

Impact

0 posts edited

0 helpful flags

4 votes cast

6 Questions

Votes Activity Newest Views

6

11

votes

2

answers

3k

views

Clear, complete, proof that a language is Turing Compete?

computability turing-machines automata turing-completeness church-turing-thesis

Sep 30 '13 at 17:12 Community♦ 1

5

votes

2

answers

613

views

Is $a^n b^n$ an artificial language or does it occur in the real world?

formal-languages context-free modelling

Jan 6 '14 at 10:16 Raphael♦ 69k

3

votes

2

answers

939

views

Why does little endian apply to numbers and not to text strings?

strings number-formats binary

Jan 22 '19 at 11:22 MSalters 659

2

3

votes

1

answer

2k

views

Is this an example of a type-0 grammar that is not context-sensitive?

formal-grammars context-sensitive

Nov 21 '15 at 20:04 Raphael♦ 69k

1

3

votes

2

answers

145

views

Can a method be written if the language is undecidable?

formal-grammars undecidability decision-problem halting-problem turing-completeness

Sep 21 '13 at 17:08 David Richerby 78.4k

0

votes

1

answer

55

views

Copy operation in under 9 states?

finite-automata turing-machines

Sep 23 at 16:01 Community♦ 1

Computer Science Stack Exchange works best with JavaScript enabled