Computing the throughput of concatenation state machines

DOI10.1016/J.JDA.2007.04.002MaRDI QIDQ954952zbMATH OpenOpenAlexFDO

Authors Jurek Czyzowicz, Wojciech Fraczak, Mohammadreza Yazdani

Publication date 18 November 2008

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2007.04.002

zbMATH Keywords

And-Or graphconcatenation state machinehyper-path mean weightminimum cycle mean

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Efficient Computation of Throughput Values of Context-Free Languages
• Approximating the minimum cycle mean
• Approximating the minimum cycle mean
• Implementation and Application of Automata
• Publication:4861740

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• Combinatorial Optimization with Rational Objective Functions
• Directed hypergraphs and applications
• Dynamic Programming as Graph Searching: An Algebraic Approach
• Faster parametric shortest path and minimum‐balance algorithms
• Finding minimum cost to time ratio cycles with small integral transit times
• Finding the \(K\) shortest hyperpaths
• Generalized AND/OR graphs
• Implementation and Application of Automata
• New scaling algorithms for the assignment and minimum mean cycle problems

Cited in

(1)

• Efficient Computation of Throughput Values of Context-Free Languages

This page was built for publication: Computing the throughput of concatenation state machines

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