Jump to content

Nested stack automaton

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by AnomieBOT (talk | contribs) at 15:25, 16 April 2012 (Dating maintenance tags: {{Merge-to}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks.[1] A nested stack automaton may read its stack, in addition to pushing or popping it. A nested stack automaton is capable of recognizing an indexed language[2], and in fact the class of indexed languages is exactly the class of languages accepted by one-way nondeterministic nested stack automata.[1]

See also

References

  1. ^ a b Aho, Alfred (1969). "Nested stack automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529. ISSN 0004-5411.
  2. ^ Partee, Barbara (1990). Mathematical Methods in Linguistics. Kluwer Academic Publishers. pp. 536–542. ISBN 978-90-277-2245-4. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

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