Nested Stack Automata

@article{Aho1969NestedSA,
  title={Nested Stack Automata},
  author={Alfred V. Aho},
  journal={Journal of the ACM (JACM)},
  year={1969},
  volume={16},
  pages={383 - 406}
}
  • A. Aho
  • Published 1969
  • Computer Science
  • Journal of the ACM (JACM)

Topics from this paper

On the Relationship between Indexed Grammars and Logic Programs
  • E. Bertsch
  • Mathematics, Computer Science
  • J. Log. Program.
  • 1994
TLDR
Detailed constructions are provided demonstrating that the class of indexed Grammars introduced as a simple extension of context-free grammars has essentially the same expressive power as theclass of logic programs with unary predicates and functions and exactly one variable symbol. Expand
Chinese Number-Names, Tree Adjoining Languages, and Mild Context-Sensitivity
TLDR
It is shown that the number-name system of Chinese is generated neither by this formalism nor by any other equivalent or weaker ones, suggesting that such a task might require the use of the more powerful Indexed Grammar formalism. Expand
A necessary and sufficient condition for the existence of hoare logics
  • R. Lipton
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
Here the main result is the extension of this result to Hoare logic for other programming languages, where the programs of P have a decidable halting problem over fini te interpretations. Expand
A new pumping lemma for indexed languages, with an application to infinite words
  • Tim Smith
  • Computer Science, Mathematics
  • Inf. Comput.
  • 2017
TLDR
It is shown that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding, and this implies that the infinite words determined by indexed languages are exactly the morphic words. Expand
New Frontiers Beyond Context-Freeness: Di-Grammars and Di-Automata.
TLDR
The grammar-formalism generating the new class - the DI-grammars - cover unbound dependencies in a rather natural way and can equivalently be characterized by a special type of automata - DI-automata. Expand
Indexed Grammars—An Extension of Context-Free Grammars
  • A. Aho
  • Computer Science
  • J. ACM
  • 1968
TLDR
A new type of grammar for generating formal languages, called an indexed grammar, is presented, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages. Expand
On finite-index indexed grammars and their restrictions
TLDR
This work looks at larger families of (restricted) indexed languages and study their combinatorial and decidability properties, and their relationships. Expand
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
TLDR
It is proved that (i) each MSO graph transduction can be used as storage transformation in an MSOgraph storage type, (ii) every automatic storage type is MSO-expressible, and (iii) the pushdown operator on storage types preserves the property of MSO -expressibility. Expand
Principal abstract families of weighted tree languages
Abstract We introduce semiring-weighted regular tree grammars with storage where the semiring is complete. We show that the class of weighted tree languages generated by them is a principal abstractExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Two-way balloon automata and AFL
TLDR
It is proved that the family of languages accepted by the closed class of two-way balloon automata of (nonerasing) (deterministic) stack acceptors is such a family. Expand
Checking Automata and One-Way Stack Languages
  • S. Greibach
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1969
TLDR
The quasi-real-time one- way stack languages are not a full AFL but are a proper subAFL of the one-way stack languages, which properly include the stack languages. Expand
Formal languages and their relation to automata
  • J. Hopcroft, J. Ullman
  • Computer Science
  • Addison-Wesley series in computer science and information processing
  • 1969
TLDR
The theory of formal languages as a coherent theory is presented and its relationship to automata theory is made explicit, including the Turing machine and certain advanced topics in language theory. Expand
Decidable and Undecidable Questions About Automata
TLDR
It is shown that in many cases the solvability of one of these questions for one closed class in a family implies that some other question are solvable for the closed classes of that family. Expand
Deterministic Stack Automata and the Quotient Operator
TLDR
The deterministic stack automaton with a one-way input (dsa) is considered and it is shown that if L is a language accepted by a dsa and R is a regular set, then L/R={w| for some x in R, wx is in L}. Expand
Indexed Grammars—An Extension of Context-Free Grammars
  • A. Aho
  • Computer Science
  • J. ACM
  • 1968
TLDR
A new type of grammar for generating formal languages, called an indexed grammar, is presented, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages. Expand
One-way nondeterministic real-time list-storage languages
TLDR
A device is presented which has its memory organized as a linear list, a type of storage equivalent to having two pushdown stores, and the nondeterministic automaton which results when the input is read one-way and the device operates in real-time. Expand
Sets Accepted by One-Way Stack Automata Are Context Sensitive
TLDR
It is shown that a nondeterministic stack automation with a one-way input tape can be simulated by a deterministic linear bounded automaton. Expand
Time and Tape Complexity of Pushdown Automaton Languages
TLDR
This paper considers languages defined by pushdown store systems and investigates how much time and memory is needed in order to de- termine whether an arbitrary input sentence belongs or does not belong to some language in this class. Expand
Two-Type Bracketed Grammars
TLDR
It is shown that this type of grammar generates a class of languages which is exactly the class of one way nondeterministic stack languages, so a new approach to the study of stack languages is opened. Expand
...
1
2
...