Propriétés booléennes des langages stochastiques

DOI10.1007/BF01890611zbMath0262.94037OpenAlexW1565465168MaRDI QIDQ5678784

Michel Fliess

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1007/bf01890611

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Valuations, completions, formal power series and related constructions (associative rings and algebras) (16W60)

Related Items

Stochastically costed tree automata: Turakainen's theorem ⋮ The notion of a probabilistic cellular acceptor ⋮ Classes of formal grammars ⋮ Unnamed Item

Cites Work

• A note on recurring series
• Power Series Representing Certain Rational Functions
• On the definition of a family of automata
• On a Theorem of R. Jungen
• Some aspects of probabilistic automata
• Generalized Automata and Stochastic Languages
• Algèbres de Hadamard
• A context-free language which is not acceptable by a probabilistic automaton
• Some closure properties of the family of stochastic languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item