Generalized2 sequential machine maps
TLDR
The concept of generalized sequential machine (gsm) mapping is developed here in its natural extension to trees (or expressions) in the introduction of syntax directed translations and transformations into formallanguage theory.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1970-08-01 and is currently open access. It has received 255 citations till now. The article focuses on the topics: Syntax (programming languages) & Semantics (computer science).read more
Citations
More filters
Book
Tree Automata Techniques and Applications
Hubert Comon,Max Dauchet,Rémi Gilleron,Florent Jacquemard,Denis Lugiez,Christof Löding,Sophie Tison,Marc Tommasi +7 more
TL;DR: The goal of this book is to provide a textbook which presents the basics ofTree automata and several variants of tree automata which have been devised for applications in the aforementioned domains.
Journal ArticleDOI
Initial Algebra Semantics and Continuous Algebras
TL;DR: An overview of initial algebra semantics is provided and the major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as more basic operations.
Journal ArticleDOI
Tree adjunct grammars
TL;DR: A tree generating system called a tree adjunct grammar is described and its formal properties are studied relating them to the tree generating systems of Brainerd and Rounds and to the recognizable sets and local sets discussed by Thatcher.
Journal ArticleDOI
Bottom-up and top-down tree transformations - a comparison
TL;DR: A new tree transformation model is introduced which generalizes both the top-down and the bottom-up tree transducer, and is used to give simple proofs of composition results concerning bottom- up tree transformations.
References
More filters
Journal ArticleDOI
Recognition and parsing of context-free languages in time n3*
TL;DR: A recognition algorithm is exhibited whereby an arbitrary string over a given vocabulary can be tested for containment in a given context-free language and it is shown that it is completed in a number of steps proportional to the “cube” of the number of symbols in the tested string.
Journal ArticleDOI
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.
Journal ArticleDOI
Decision problems of finite automata design and related arithmetics
TL;DR: The problems are concerned with the problems of automatically designing an automaton from a specification of a relation which is to hold between the automaton's input sequences and determined output sequences and the formalisms for expressing "design requirements" are described.
Journal ArticleDOI
Tree acceptors and some of their applications
TL;DR: It is shown here that the weak secondorder theory of two successors is decidable, thus settling a problem of Buchi, and this result is applied to obtain positive solutions to the decision problems for various other theories, e.g., the weaksecond-order theories of order types built up from the finite types.