A Characterization of Machine Mappings

DOI10.4153/CJM-1966-040-3MaRDI QIDQ5518380zbMATH OpenFDO

Authors Seymour Ginsburg, Gene F. Rose

Publication date 1966

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1966-040-3

zbMATH Keywords

mappinggeneralized sequential machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(18)

• scientific article; zbMATH DE number 3327945 (Why is no real title available?)
• scientific article; zbMATH DE number 3335030 (Why is no real title available?)
• Macro tree transducers
• Counting with rational functions
• Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
• Sur une variante des fonctions séquentielles
• scientific article; zbMATH DE number 3309208 (Why is no real title available?)
• Syntactic operators on full semiAFLs
• The many facets of string transducers (invited talk)
• A characterization of adding machine maps
• Semantic Foundations for Deterministic Dataflow and Stream Processing
• Clocks in dataflow languages
• Bijective sequential mappings of a free monoid onto another
• A general theory of translation
• Minimizing subsequential transducers: a survey.
• scientific article; zbMATH DE number 3918680 (Why is no real title available?)
• Some uniformly erasable families of languages
• A Kleene Theorem for Forest Languages

This page was built for publication: A Characterization of Machine Mappings

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