Live briefing
Everything about Nested stack automaton
In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data that can be additional stacks. Like a stack automaton, a nested stack automaton may step up or down in the stack, and read the current symbol; in addition, it may at any place create a new stack, operate on that one, eventually destroy it, and continue operating on the old stack. This way, stacks can be nested recursively to an arbitrary depth; however, the automaton always operates on the innermost stack only. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Nested stack automatonA 5-minute orientation
- Pick up a classic book: Programming Language PragmaticsThe most-reprinted book on the subject
- Read the landmark paper: Nested Stack AutomataCited 104 times
- Go sideways: Pushdown automatonA closely related topic
- Go sideways: Nondeterministic finite automatonA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Programming Language PragmaticsMichael Lee Scott · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Pushdown automaton In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown…
- Nondeterministic finite automaton In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source…
- Deterministic pushdown automaton In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata…
- Automata theory Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in…
- Deterministic finite automaton In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or…
- Nested word In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalizat…
- Two-way finite automaton In computer science, in particular in automata theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input. A two-way…
- Read-only Turing machine A read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing…