Talk:Indexed language

This article is within the scope of WikiProject Philosophy, a collaborative effort to improve the coverage of content related to philosophy on Wikipedia. If you would like to support the project, please visit the project page, where you can get more details on how you can help, and where you can join the general discussion about philosophy content on Wikipedia.PhilosophyWikipedia:WikiProject PhilosophyTemplate:WikiProject PhilosophyPhilosophy articles

Low

This article has been rated as Low-importance on the project's importance scale.

Associated task forces:
/
	Logic

Complexity characterization?

Is there one? Seems like more than PTIME. JMP EAX (talk) 10:32, 17 August 2014 (UTC)[reply]

Example for context-sensitive, but not indexed language

Could somebody please provide an example for a language that is context-sensitive, but not indexed? The article says that { (abⁿ)ⁿ | n≥0 } isn't indexed; I guess that it is context-sensitive, but I'm unable to establish it (writing context-sensitive grammars is an error-prone task, cf. Talk:Context-sensitive grammar). - Jochen Burghardt (talk) 13:49, 25 February 2015 (UTC)[reply]

Talk:Indexed language

Complexity characterization?

Example for context-sensitive, but not indexed language

Navigation menu

Search