Representation of a word function as the sum of two functions

DOI10.1007/BF01768487zbMath0394.68045MaRDI QIDQ4176986

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)

Related Items (2)

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

Cites Work

• Unnamed Item
• Realizations by stochastic finite automata
• Hypo-multiplicative number-theoretic functions
• On Stochastic Processes Derived From Markov Chains
• Probabilistic automata and stochastic transformations

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