scientific article; zbMATH DE number 7533339

DOI10.4230/LIPICS.CSL.2018.14MaRDI QIDQ5079737FDOQ5079737

Authors:

Publication date: 28 May 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

ambiguityregular languagesprobabilistic finite automata

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Probabilistic automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic automata on finite words: decidable and undecidable problems
• Products of Indecomposable, Aperiodic, Stochastic Matrices
• On finite semigroups of matrices
• Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices
• Definite and Quasidefinite Sets of Stochastic Matrices
• Title not available (Why is that?)
• Deciding the value 1 problem for probabilistic leaktight automata
• Deciding the Value 1 Problem for Probabilistic Leaktight Automata
• On the degree of ambiguity of finite automata
• Power of Randomization in Automata on Infinite Strings
• Title not available (Why is that?)
• Probabilistic Automata of Bounded Ambiguity
• Irregular behaviours for probabilistic automata
• Probabilistic Automata with Isolated Cut-Points
• Model Checking Failure-Prone Open Systems Using Probabilistic Automata
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Asymptotic approximation by regular languages
• Title not available (Why is that?)
• Concise representations of regular languages by degree and probabilistic finite automata
• On the computational complexity of approximating distributions by probabilistic automata
• Title not available (Why is that?)

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 Q5079737)