# Chomsky hierarchy

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ArXiv
- 2014

The Chomsky hierarchy plays a prominent role in the foundations of the theoretical computer science relating classes of formal… (More)

Is this relevant?

2012

2012

- Theor. Comput. Sci.
- 2012

In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular… (More)

Is this relevant?

2008

2008

- RelMiCS
- 2008

The algebraic approach to formal language and automata theory is a continuation of the earliest traditions in these fields which… (More)

Is this relevant?

2008

2008

- Wiley Encyclopedia of Computer Science and…
- 2008

Defn: Let T : N → N. A TM M is said to have time complexity T (n) if on every input string w, M takes no more than T (|w… (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

Is this relevant?

2007

2007

- APLAS
- 2007

A remarkable result in [4] shows that in spite of its being less expressive than CCS w.r.t. weak bisimilarity, CCS! (a CCS… (More)

Is this relevant?

2007

2007

- DCFS
- 2007

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing… (More)

Is this relevant?

2005

2005

- FCT
- 2005

Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and… (More)

Is this relevant?

Review

1999

Review

1999

- Jewels are Forever
- 1999

This review paper will report on some recent discoveries in the area of Formal Languages, chie y by F. Otto, G. Buntrock and G… (More)

Is this relevant?

1985

1985

- EACL
- 1985

The central claim of the paper is that NL stringsets are regular. Three independent arguments are offered in favor of this… (More)

Is this relevant?