A general theory of translation

DOI10.1007/BF01703920zbMath0175.00803MaRDI QIDQ5563368

John E. Hopcrofts, A. V. Aho, Jeffrey D. Ullman

Publication date: 1969

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items

Characterizations of transductions defined by abstract families of transducers, Unnamed Item, Construction of an effective algorithm to find the isomorphism of two simple finite semigroups, Restarting transducers, regular languages, and rational relations, On determinism versus nondeterminism for restarting automata, Abstract families of relations, Unnamed Item, Unnamed Item, Transducing reversibly with finite state machines, Transducing reversibly with finite state machines, The power of two-way deterministic checking stack automata, Origin-equivalence of two-way word transducers is in PSPACE, Unnamed Item, Three hierarchies of transducers, Normality and two-way automata, The many faces of a translation, Query automata over finite trees, A syntax directed macro processor, Bipartite double cover and perfect 2-matching covered graph with its algorithm, Complexity and categoricity of injection structures induced by finite state transducers

Cites Work

• Unnamed Item
• Unnamed Item
• A syntax directed compiler for ALGOL 60
• On Relations Defined by Generalized Finite Automata
• A Characterization of Machine Mappings
• The theory of sequential relations
• Decidable and Undecidable Questions About Automata
• An Approach to a Unified Theory of Automata
• Syntax-Directed Transduction
• Two-way pushdown automata
• Indexed Grammars—An Extension of Context-Free Grammars
• Programmed Grammars and Classes of Formal Languages
• Preservation of languages by transducers
• Operations Which Preserve Definability in Languages
• On the nonexistence of a phrase structure grammar for ALGOL 60