Representation of a word function as the sum of two functions

DOI10.1007/BF01768487MaRDI QIDQ4176986zbMATH OpenFDO

Authors Alan Cobham

Publication date 1978

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

zbMATH Keywords

Free MonoidFinite RankWord Function

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Cites work

• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Hypo-multiplicative number-theoretic functions
• On Stochastic Processes Derived From Markov Chains
• Probabilistic automata and stochastic transformations
• Realizations by stochastic finite automata

Cited in

(2)

• Recognizable formal power series on trees
• Automatic error correction in flexion languages

This page was built for publication: Representation of a word function as the sum of two functions

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