Efficient Computation of Throughput Values of Context-Free Languages

DOI10.1007/978-3-540-76336-9_20zbMath1139.68358OpenAlexW2106629988MaRDI QIDQ3503907

Wojciech Fraczak, Jurek Czyzowicz, Wojciech Rytter, Didier Caucal

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00620156/file/throughput.pdf

zbMATH Keywords

context-free grammarthroughputpush-down automatonminimal mean weight

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Derivation Tree Analysis for Accelerated Fixed-Point Computation ⋮ Derivation tree analysis for accelerated fixed-point computation

Cites Work

• Computing the throughput of concatenation state machines
• A characterization of the minimum cycle mean in a digraph
• On Fixed Point Equations over Commutative Semirings
• On Context-Free Languages

This page was built for publication: Efficient Computation of Throughput Values of Context-Free Languages