From 412c2059bf7cc5c35079bfa1074732c39d826c94 Mon Sep 17 00:00:00 2001 From: Alexandre Duret-Lutz Date: Thu, 28 Dec 2017 20:27:17 +0100 Subject: [PATCH] man: obsolete paragraph in ltlcross doc MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Reported by FrantiĊĦek Blahoudek. * bin/man/ltlcross.x: Remove obsolete paragraph with reference to columns in_states, in_edges, in_transitions, and in_acc that were removed in 1.99.3. --- bin/man/ltlcross.x | 8 +------- 1 file changed, 1 insertion(+), 7 deletions(-) diff --git a/bin/man/ltlcross.x b/bin/man/ltlcross.x index 295fbb195..f16b17a74 100644 --- a/bin/man/ltlcross.x +++ b/bin/man/ltlcross.x @@ -151,13 +151,7 @@ translated automaton. Column \fBedges\fR counts the number of edges \fBtransitions\fR counts the number of assignment-labeled transitions that might have been merged into a formula-labeled edge. For instance an edge labeled by \f(CWtrue\fR will be counted as 2^3=8 transitions if -the automaton mention 3 atomic propositions. -.PP -If the translator produced a Streett or Rabin automaton, these columns -contains the size of a TGBA (or BA) produced by ltlcross from that -Streett or Rabin automaton. Check \fBin_states\fR, \fBin_edges\fR, -\fBin_transitions\fR, and \fBin_acc\fR for statistics about the actual -input automaton. +the automaton uses 3 atomic propositions. .TP \fBscc\fR, \fBnonacc_scc\fR, \fBterminal_scc\fR, \fBweak_scc\fR, \fBstrong_scc\fR The number of strongly connected components in the automaton. The