Operations Which Preserve Definability in Languages

DOI10.1145/321160.321167zbMATH Open0192.07201OpenAlexW2074276971MaRDI QIDQ5586341FDOQ5586341

Authors: 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

zbMATH Keywords

languages, automata, networks

Cited In (15)

• Bounded Regular Sets
• Closures which preserve finiteness in families of languages
• Boolean grammars and gsm mappings
• The theory of languages
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• Interpolazione e smoothing mono e bidimensionali relativi ad operatori differenziali lineari
• The theory of languages
• Tree acceptors and some of their applications
• On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
• A general theory of translation
• A Note on Pushdown Store Automata and Regular Systems
• Bracketed context-free languages
• Are two context-free languages translatable in a syntax-directed translation scheme?
• Characterizations of transductions defined by abstract families of transducers
• Substitution in families of languages

This page was built for publication: Operations Which Preserve Definability in Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586341)