scientific article; zbMATH DE number 3572058

MaRDI QIDQ4143209zbMATH OpenFDO

Authors Giancarlo Mauri, Alberto Bertoni, Mauro Torelli

Publication date 1977

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Cited in

(18)

• On the continuous dependence between a matrix product and its factors for finite systems of stochastic and substochastic matrices
• Non-deterministic weighted automata evaluated over Markov chains
• Polynomially ambiguous probabilistic automata on restricted languages
• On injectivity of quantum finite automata
• Freeness properties of weighted and probabilistic automata over bounded languages
• Quantum automata and algebraic groups
• Some formal tools for analyzing quantum automata.
• Distributed synthesis in continuous time
• Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
• Polynomially Ambiguous Probabilistic Automata on Restricted Languages
• Acceptance Ambiguity for Quantum Automata
• Quantum finite automata: advances on Bertoni's ideas
• Preface
• Recurrence and transience for finite probabilistic tables
• On the intersection problem for quantum finite automata
• Probabilistic input-driven pushdown automata
• On some decision problems on quantum automata
• On the undecidability of probabilistic planning and related stochastic optimization problems

This page was built for publication:

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