--- a/main/queueing/inst/dtmcmtta.m	Mon Sep 01 16:15:19 2014 +0000
+++ b/main/queueing/inst/dtmcmtta.m	Sun Sep 07 15:21:58 2014 +0000
@@ -1,4 +1,4 @@
-## Copyright (C) 2012 Moreno Marzolla
+## Copyright (C) 2012, 2014 Moreno Marzolla
 ##
 ## This file is part of the queueing toolbox.
 ##
@@ -28,8 +28,8 @@
 ## @cindex Markov chain, discrete time
 ##
 ## Compute the expected number of steps before absorption for a
-## DTMC with @math{N \times N} transition probability matrix @var{P};
-## compute also the fundamental matrix @var{N} for @var{P}.
+## DTMC with state space @math{@{1, 2, @dots{} N@}} 
+## and transition probability matrix @var{P}.
 ##
 ## @strong{INPUTS}
 ##
@@ -38,6 +38,9 @@
 ## @item P
 ## @math{N \times N} transition probability matrix.
 ##
+## @item p0
+## Initial state occupancy probabilities.
+##
 ## @end table
 ##
 ## @strong{OUTPUTS} 

--- a/main/queueing/inst/dtmctaexps.m	Mon Sep 01 16:15:19 2014 +0000
+++ b/main/queueing/inst/dtmctaexps.m	Sun Sep 07 15:21:58 2014 +0000
@@ -1,4 +1,4 @@
-## Copyright (C) 2012 Moreno Marzolla
+## Copyright (C) 2012, 2014 Moreno Marzolla
 ##
 ## This file is part of the queueing toolbox.
 ##
@@ -17,15 +17,15 @@
 
 ## -*- texinfo -*-
 ##
-## @deftypefn {Function File} {@var{L} =} dtmctaexps (@var{P}, @var{n}, @var{p0})
-## @deftypefnx {Function File} {@var{L} =} dtmctaexps (@var{P}, @var{p0})
+## @deftypefn {Function File} {@var{M} =} dtmctaexps (@var{P}, @var{n}, @var{p0})
+## @deftypefnx {Function File} {@var{M} =} dtmctaexps (@var{P}, @var{p0})
 ##
 ## @cindex time-alveraged sojourn time, DTMC
 ## @cindex discrete time Markov chain
 ## @cindex Markov chain, discrete time
 ## @cindex DTMC
 ##
-## Compute the @emph{time-averaged sojourn time} @code{@var{M}(i)},
+## Compute the @emph{time-averaged sojourn times} @code{@var{M}(i)},
 ## defined as the fraction of time steps @math{@{0, 1, @dots{}, n@}} (or
 ## until absorption) spent in state @math{i}, assuming that the state
 ## occupancy probabilities at time 0 are @var{p0}.
@@ -52,6 +52,7 @@
 ## @table @var
 ##
 ## @item M
+## Vector of length @math{N}. 
 ## If this function is called with three arguments, @code{@var{M}(i)} is
 ## the expected fraction of steps @math{@{0, 1, @dots{}, n@}} spent in
 ## state @math{i}, assuming that the state occupancy probabilities at