Operations Which Preserve Definability in Languages
From MaRDI portal
Publication:5586341
DOI10.1145/321160.321167zbMath0192.07201OpenAlexW2074276971MaRDI QIDQ5586341
Seymour Ginsburg, Gene F. Rose
Publication date: 1963
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321160.321167
Related Items (15)
The theory of languages ⋮ A general theory of translation ⋮ The theory of languages ⋮ Bounded Regular Sets ⋮ Characterizations of transductions defined by abstract families of transducers ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A Note on Pushdown Store Automata and Regular Systems ⋮ Are two context-free languages translatable in a syntax-directed translation scheme? ⋮ BOOLEAN GRAMMARS AND GSM MAPPINGS ⋮ Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari ⋮ Bracketed context-free languages ⋮ Closures which preserve finiteness in families of languages ⋮ Substitution in families of languages ⋮ Tree acceptors and some of their applications ⋮ On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
This page was built for publication: Operations Which Preserve Definability in Languages
