Realizations by stochastic finite automata

DOI10.1016/S0022-0000(71)80005-3zbMath0236.94042MaRDI QIDQ2552490

J. W. Carlyle, Azaria Paz

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (17)

A finite model construction for coalgebraic modal logic ⋮ Unnamed Item ⋮ Learning Weighted Automata ⋮ Logics of Finite Hankel Rank ⋮ Minimisation of Multiplicity Tree Automata ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Probabilistic automata ⋮ Learning weighted automata over principal ideal domains ⋮ Generalization bounds for learning weighted automata ⋮ A spectral algorithm for learning hidden Markov models ⋮ Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries ⋮ Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ Weighted automata are compact and actively learnable ⋮ Representation of a word function as the sum of two functions ⋮ On the Rademacher Complexity of Weighted Automata ⋮ Image-binary automata

Cites Work

• Unnamed Item
• Some aspects of probabilistic automata
• Equivalences between probabilistic and deterministic sequential machines
• Minimization theorems and techniques for sequential stochastic machines
• On the external probability structure of finite-state channels
• Fuzzy events realized by finite probabilistic automata
• Identification of State-calculable Functions of Finite Markov Chains

This page was built for publication: Realizations by stochastic finite automata