Description: Fix typos in info documentation
Author: Rafael Laboissiere <rafael@debian.org>
Forwarded: no
Last-Update: 2016-08-30

--- octave-queueing-1.2.3.orig/doc/markovchains.texi
+++ octave-queueing-1.2.3/doc/markovchains.texi
@@ -907,7 +907,7 @@ at time @var{t}, given initial state occ
 Infinitesimal generator matrix. @var{Q} is a @math{N \times N} square
 matrix where @code{@var{Q}(i,j)} is the transition rate from state
 @math{i} to state @math{j}, for @math{1 @leq{} i \neq j @leq{} N}.
-#var{Q} must satisfy the property that @math{\sum_{j=1}^N Q_{i, j} =
+@var{Q} must satisfy the property that @math{\sum_{j=1}^N Q_{i, j} =
 0}
 
 @item t
--- octave-queueing-1.2.3.orig/doc/queueingnetworks.texi
+++ octave-queueing-1.2.3/doc/queueingnetworks.texi
@@ -140,17 +140,17 @@ routing probabilities.
 (Open models only) Overall external arrival rate to the system as a whole: @math{\lambda =
 \sum_k \lambda_k}.
 
-@item N
+@item @math{N}
 (Closed models only) Total number of requests in the system.
 
-@item S_k
+@item @math{S_k}
 Average service time. @math{S_k} is the average service time on service
 center @math{k}. In other words, @math{S_k} is the average time from the
 instant in which a request is extracted from the queue and starts being
 service, and the instant at which service finishes and the request moves
 to another queue (or exits the system).
 
-@item P_{i, j}
+@item @math{P_{i, j}}
 Routing probability matrix. @math{{\bf P} = [P_{i, j}]} is a @math{K
 \times K} matrix such that @math{P_{i, j}} is the probability that a
 request completing service at server @math{i} will move directly to
@@ -158,7 +158,7 @@ server @math{j}, The probability that a
 after service at service center @math{i} is @math{1-\sum_{j=1}^K P_{i,
 j}}.
 
-@item V_k
+@item @math{V_k}
 Mean number of visits the center @math{k} (also called @emph{visit
 ratio} or @emph{relative arrival rate}).
 
@@ -1613,21 +1613,21 @@ for the customer classes.
 @item @lambda
 (open networks) Overall external arrival rate to the whole system: @math{\lambda = \sum_c \sum_k \lambda_{c, k}}
 
-@item N_c
+@item @math{N_c}
 (closed networks) Number of class @math{c} requests in the system.
 
-@item S_{c, k}
+@item @math{S_{c, k}}
 Average service time. @math{S_{c, k}} is the average service time on
 service center @math{k} for class @math{c} requests.
 
-@item P_{r, i, s, j}
+@item @math{P_{r, i, s, j}}
 Routing probability matrix. @math{{\bf P} = [P_{r, i, s, j}]} is a @math{C
 \times K \times C \times K} matrix such that @math{P_{r, i, s, j}} is
 the probability that a class @math{r} request which completes service
 at server @math{i} will move to server @math{j} as a class @math{s}
 request.
 
-@item V_{c, k}
+@item @math{V_{c, k}}
 Mean number of visits of class @math{c} requests to center @math{k}.
 
 @end table
@@ -1636,7 +1636,7 @@ Mean number of visits of class @math{c}
 
 @table @math
 
-@item U_{c, k}
+@item @math{U_{c, k}}
 Utilization of service center @math{k} by class @math{c} requests. The
 utilization is defined as the fraction of time in which the resource
 is busy (i.e., the server is processing requests).  If center @math{k}
@@ -1647,18 +1647,18 @@ center), then @math{U_{c, k}} denotes th
 is defined as @math{U_{c, k} = X_{c, k} S_{c, k}}; in this case the
 utilization may be greater than one.
 
-@item R_{c, k}
+@item @math{R_{c, k}}
 Average response time experienced by class @math{c} requests on service
 center @math{k}. The average response time is defined as the average
 time between the arrival of a customer in the queue, and the completion
 of service.
 
-@item Q_{c, k}
+@item @math{Q_{c, k}}
 Average number of class @math{c} requests on service center
 @math{k}. This includes both the requests in the queue, and the request
 being served.
 
-@item X_{c, k}
+@item @math{X_{c, k}}
 Throughput of service center @math{k} for class @math{c} requests.  The
 throughput is defined as the rate of completion of class @math{c}
 requests.
@@ -1669,7 +1669,7 @@ requests.
 
 @table @math
 
-@item U_k
+@item @math{U_k}
 Utilization of service center @math{k}:
 @iftex
 @tex
