Jump to content

Indexed language

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jonsafari (talk | contribs) at 19:49, 6 October 2006 (new article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An indexed language is a formal language discovered by Alfred Aho.[1] They are a proper subset of context-sensitive languages, and a proper superset of context-free languages. They may be of the form:

[2]

See also

References

  1. ^ Aho, Alfred. "Indexed grammars—an extension of context-free grammars". Journal of the ACM. 15 (4): 647–671.
  2. ^ Hopcroft, John (1979). Introduction to automata theory, languages, and computation. Addison-Wesley. p. 390. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)


Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Indexed_language&oldid=79902401"