Representation of a word function as the sum of two functions

DOI10.1007/BF01768487zbMATH Open0394.68045MaRDI QIDQ4176986FDOQ4176986

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

• Title not available (Why is that?)
• Realizations by stochastic finite automata
• On Stochastic Processes Derived From Markov Chains
• Hypo-multiplicative number-theoretic functions
• Probabilistic automata and stochastic transformations

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)