

PREV NEXT  FRAMES NO FRAMES 
n
beginning
at character letter
isLetter
n
beginning at character
a
.
c
if there is one
and creates it otherwise.
val
to the queue.
l
at the rear of the queue.
(val, elem)
to the queue.
l
to the queue.
next
array to allow a transition
by c
.
p
to q
labeled a
if it does not exist already.
p
to q
labeled alphabet.toChar(a)
if it does not exist already.
p
to q
labeled a
.
p
to q
labeled alphabet.toChar(a)
.
nn
to the automaton b
(the minimal automaton in construction) as the class of state p
in the original automaton a
.
nn
to the automaton b
(the minimal automaton in construction) as the class of state p
in the original automaton a
.
addToTrie()
.
addToTrie()
.
Advance()
of Section 1.6.1.
s
.
y
such that My >= ra y
iterating the transformation y = (1 / r(y)) M y
starting with y = x
with
r(y) = min((My)_i / y_i)
the Wielandt function.
k
first characters
of a text.
Border(x)
of Section 1.2.2.
BorderSharp(x)
of Problem 1.2.1.
d
according
to the value of column k
in the array of signatures s
.
d
according
to the value of column k
in the array of signatures s
.
ExpressionCompiler
Usage: java CompileExpression Method Option expression
The only method presently available is T (Thomson's algorithm
using ThompsonCompiler
).
CircularMin()
of Section 1.2.5.
p
by an epsilon path.
s
.
p
followed by a path with input epsilon.
s
Object.compareTo
.
a
and b
.
s
and t
, which are supposed to be literal.
shl
of states.
shl
of states.
append()
.
i
to its value in the alphabet a
.
s
the frequencies of the words
appearing in the table table
.
Current()
of Section 1.6.1.
n
states
and k
letters.
n
states and k
letters.
n
states and alphabet a
.
p
.
p
in front.
S > (S)S  ""
.
rho_M
, the
maximal eigenvalue of the matrix M
.
ETF
grammar : E > E + T
T > T * F
F > (E)  char
.
ETF
grammar which
is LL(1) : E > Te
e > +Te  ""
T > Ft
t > *Ft  ""
F > (E)  char
.
(1/k)Sigma s[i]log(s[i])
.
num
.
enumerate(isOn)
returns the number
of states of the trimmed automaton.
Epsilon()
.
\e \times a^*
.
Object.hashCode
.
a
and b
are equal.
a
and b
are equal.
p,q
are equivalent in the sense that
p=q mod c
and p.a=q.a mod c
for every letter a
.
p,q
are equivalent in the sense that
p=q mod c
and p.a=q.a mod c
for every letter a
.
EvalExp()
of Section 1.6.1.
EvalFact()
of Section 1.6.1.
EvalTerm()
of Section 1.6.1.
Explore(t, s, b)
of Section 1.3.3
which returns
the list of sets of half edges realizing the determinization
of the NFA.
explore
but with an implementation of the
set of states of the resulting DFA
via a HashMap
.
explore
but with an implementation of the
set of states of the resulting DFA
via a HashMap
.
explore
but with a transmission of the
index of the set s
in the list t
.
Follow()
.
a>ab, b>a
.
First()
to Strings.
FirstChild()
.
Follow()
.
exp
(used to create an alphabet from a regular expression).
name
.
n
symbols.
2
by 2
matrix of the golden mean system.
Object.hashCode
.
word
.
p
.
n
states
on the alphabet a
.
IntList
. c
if
there is one and 1
otherwise.
head
in front of the list.
table
and
label
.
table1
and table2
.
true
if the queue is empty, which means
that front
is null
c
is in the alphabet.
(val, elem)
is in the queue.
s
.
s
.
s
.
IsInTrie()
of Section 1.3.1.
p
is a leaf of the trie.
p
is a leaf of the trie.
p
is a leaf of the trie.
p
is a leaf of the trie.
IsSubword()
of Section 1.2.4.
LL(1)
topdown analysis.
LLTable
and initializes the stack.
s
and t
.
LCS()()
of Section 1.2.4.
x
and y
.
LcsLengthArray()
of Section 1.2.4.
x
.
LongestCommonPrefix()
of Section 1.2.1.
s
.
x
in the form (fact1)(fact2)...
lyndonFactorization(String) 
Static method in class ElementaryAlgorithms
Implements the function LyndonFactorization()
of Section 1.2.5.
lyndonFactorizationR(String, int) 
Static method in class ElementaryAlgorithms
The same as lyndonFactorization
concerning x[k..]
M
 MinAutomaton  class MinAutomaton.
 This class implements a command computing the minimal automaton of a set of words
given in a text file using one of several possible minimization algorithms.
 MinAutomaton() 
Constructor for class MinAutomaton

 Minimizer  interface Minimizer.

 main(String[]) 
Static method in class Alphabet

 main(String[]) 
Static method in class BMinimizer

 main(String[]) 
Static method in class CompileExpression

 main(String[]) 
Static method in class DFA

 main(String[]) 
Static method in class DFT

 main(String[]) 
Static method in class Element

 main(String[]) 
Static method in class ElementaryAlgorithms

 main(String[]) 
Static method in class Entropy

 main(String[]) 
Static method in class FixedArrayTrie

 main(String[]) 
Static method in class ForaxTrie

 main(String[]) 
Static method in class Grammar

 main(String[]) 
Static method in class HopcroftMinimizer

 main(String[]) 
Static method in class ICFA

 main(String[]) 
Static method in class IDFA

 main(String[]) 
Static method in class INFA

 main(String[]) 
Static method in class IntList

 main(String[]) 
Static method in class LL

 main(String[]) 
Static method in class LinkedNFA

 main(String[]) 
Static method in class MinAutomaton

 main(String[]) 
Static method in class NFA

 main(String[]) 
Static method in class NFT

 main(String[]) 
Static method in class NonNegativeMatrix

 main(String[]) 
Static method in class PairInt

 main(String[]) 
Static method in class PairIntList

 main(String[]) 
Static method in class PairIntQueue

 main(String[]) 
Static method in class SLR

 main(String[]) 
Static method in class VariableArrayTrie

 main(String[]) 
Static method in class ZLdecode

 main(String[]) 
Static method in class ZLencode

 mark 
Variable in class State
 A marker used for the exploration.
 mergeLeaves() 
Method in class IDFA

 minConjugate(String) 
Static method in class ElementaryAlgorithms
 Returns the least conjugate of
x
.
 minimize(DFA) 
Method in class BMinimizer

 minimize(DFT) 
Method in class BMinimizer

 minimize(IDFA) 
Method in class BMinimizer
 Returns the minimal automaton deterministic recognizing the reverse of the
words recognized by
a
.
 minimize(DFA, Minimizer) 
Static method in class DFA
 Minimizes the automaton using the method m.
 minimize(Minimizer) 
Method in class DFA

 minimize(DFT, Minimizer) 
Static method in class DFT
 Minimizes the DFT using the method m.
 minimize(IDFA) 
Static method in class EcoRMinimizer
 The method called to minimize an acyclic trim automaton.
 minimize(DFA) 
Method in class FMinimizer

 minimize(DFT) 
Method in class FMinimizer

 minimize(IDFA) 
Method in class FMinimizer

 minimize(DFA) 
Method in class HopcroftMinimizer
 Returns the minimal DFA equivalent to
a
computed by Hopcroft's
algorithm.
 minimize(DFT) 
Method in class HopcroftMinimizer
 Returns the minimal DFT equivalent to a normalized DFT
a
computed by Hopcroft's
algorithm.
 minimize(IDFA) 
Method in class HopcroftMinimizer

 minimize(Minimizer) 
Method in class IDFA

 minimize(DFA) 
Method in interface Minimizer

 minimize(DFT) 
Method in interface Minimizer

 minimize(IDFA) 
Method in interface Minimizer

 minimize(DFA) 
Method in class NMinimizer
 Returns the minimal automaton of
a
.
 minimize(DFT) 
Method in class NMinimizer
 Returns the minimal DFT of
a
.
 minimize(IDFA) 
Method in class NMinimizer

 minimize(DFA) 
Method in class NbisMinimizer
 Returns the minimal automaton of
a
.
 minimize(DFT) 
Method in class NbisMinimizer
 Returns the minimal DFT of
a
.
 minimize(IDFA) 
Method in class NbisMinimizer

 minimize(IDFA) 
Method in class RMinimizer
 The method called to minimize an acyclic trim automaton.
 minimize(DFA) 
Method in class RMinimizer

 minimize(DFT) 
Method in class RMinimizer

 minimizeBis(IDFA) 
Method in class BMinimizer
 Returns the minimal automaton equivalent to
a
.
 mixMinimize() 
Method in class IDFA

N
 NFA  class NFA.
 This class implements nondeterministic finite automata.
 NFA(int) 
Constructor for class NFA
 Creates an NFA with
n
states.
 NFA(int, int) 
Constructor for class NFA
 Creates an NFA with
n
states
and k
letters.
 NFA(int, Alphabet) 
Constructor for class NFA
 Creates an NFA with
n
states
on the alphabet a
.
 NFT  class NFT.
 This class implements nondeterministic finitestate
transducers (NFT).
 NFT(int) 
Constructor for class NFT
 Creates an NFT
n
with states.
 NFT(int, int) 
Constructor for class NFT
 Creates an NFT with
n
states
and k
letters.
 NFT(int, Alphabet) 
Constructor for class NFT
 Creates an NFT with
n
states
on the alphabet a
.
 NMinimizer  class NMinimizer.
 This class implements a naive version of the Moore minimization
algorithm in
O(n^3)
.  NMinimizer() 
Constructor for class NMinimizer

 NbisMinimizer  class NbisMinimizer.
 This class implements a naive version of the Moore minimization
algorithm in
O(n^3)
.  NbisMinimizer() 
Constructor for class NbisMinimizer

 NonNegativeMatrix  class NonNegativeMatrix.
 This class implements algorithms on nonnegative matrices.
 NonNegativeMatrix(int) 
Constructor for class NonNegativeMatrix
 Creates an
n
times n
matrix.
 NonNegativeVector  class NonNegativeVector.
 This class implements nonnegative real vectors.
 NonNegativeVector(int) 
Constructor for class NonNegativeVector
 Creates an
n
vector with float
coordinates.
 naiveStringMatching(String, String) 
Static method in class ElementaryAlgorithms
 Implements the algorithm
NaiveStringMatching(x,y)
of Section 1.2.3.
 nbByHeigth(int[]) 
Method in class IDFA
 Returns the array of numbers of states by heigth.
 nbLetters 
Variable in class ICFA

 nbLetters 
Variable in class INFA

 nbProductions 
Variable in class Grammar
 The number of productions.
 nbStates 
Variable in class ICFA
 The number of states.
 nbStates 
Variable in class IDFA
 The number of states.
 nbStates 
Variable in class INFA
 The number of states.
 next(Reader, int) 
Method in class Buffer
 Shifts one character to the right the sliding window.
 next(int, String) 
Method in class DFA
 returns the state reached from state
p
after
reading the word w
.
 next 
Variable in class FixedArrayTrie
 The array of sons of the node.
 next(char) 
Method in class ForaxTrie
 Returns the son of label
c
if it exists and
null
otherwise.
 next(Set) 
Method in class ICFA
 Computes a set transition in an ICFA as an array of sets indexed
by the letters.
 next(int, char) 
Method in class IDFA
 Returns the state
next(p,c)
.
 next(Set) 
Method in class INFA
 Computes a set transition in an INFA.
 next(Set, int) 
Method in class NFA
 Computes a set transition in a literal NFA.
 next(Set, int) 
Method in class NFT
 Computes a set transition in an input literal NFT.
 next 
Variable in class VariableArrayTrie

 next(char) 
Method in class VariableArrayTrie
 Returns the node
Next(c)
if it exists
and null
otherwise.
 normalize() 
Method in class DFT
 Normalizes the DFT, pushing the output to the left.
 normalize(Set) 
Method in class NFT
 Erases the lCP of all strings in a set of binary halfedges.
 num 
Variable in class VariableArrayTrie

O
 orderEdges() 
Method in class IDFA
 Sorts the outgoing edges in alphabetic order.
 output(String) 
Method in class DFT
 Returns the output corresponding to the input
s
.
 output(Set) 
Method in class NFT
 Returns the string
w
such that (w,t)
is in the set s
for some terminal state t
.
P
 PairInt  class PairInt.
 Ths class is used to handle pairs of integers, usually
interpreted as halfedges (letter, state) in an automaton..
 PairIntList  class PairIntList.
 This class implements linked lists of pairs of integers.
 PairIntList(PairInt, PairIntList) 
Constructor for class PairIntList
 Conversions PairInt <> PairIntList
 PairIntQueue  class PairIntQueue.
 This class implements queues of pairs of integers
as linked lists from the class
PairIntList
.
 PairIntQueue() 
Constructor for class PairIntQueue

 Partition  class Partition.
 This class implements partitions of the set of integers
0,...
Partition(int) 
Constructor for class Partition
Creates the partition with one class (with name 0)
of 0,...
Partition(int[]) 
Constructor for class Partition
Creates a partition according to the class names given
in the array .
PartitionS  class PartitionS.
A weak version of the class Partition
.
PartitionS(int) 
Constructor for class PartitionS
Production  class Production.
The objects of this class are productions of contextfree grammars.
Production(char, String) 
Constructor for class Production
Creates a production c > s
with left side
c
and right side s
.
partition(DFA, Partition) 
Method in class NMinimizer
Computes the Nerode partition from the initial partition p
.
partition(IDFA, Partition) 
Method in class NMinimizer
partition(IDFA, int[]) 
Method in class NMinimizer
partition(DFA, Partition) 
Method in class NbisMinimizer
Computes the Nerode partition from the initial partition p
.
partition(IDFA, Partition) 
Method in class NbisMinimizer
partition(IDFA, int[]) 
Method in class NbisMinimizer
position 
Variable in class LL
The current index.
position 
Variable in class SLR
The current index.
positionLetters(int[][], int) 
Static method in class EcoRMinimizer
Returns the array list of positions of letters.
positionLetters(int[][], int) 
Method in class RMinimizer
Returns the array list of positions of letters.
print(PrintStream) 
Method in class ForaxTrie
product(IDFA, IDFA) 
Static method in class IDFA
Computes the direct product of the IDFA a
and b
.
productionsArray 
Variable in class Grammar
The array of grammar productions.
push(int) 
Method in class LL
Pop the left side of production n
and push the right side .
push(short) 
Method in class SLR
Push the character c
on the stack.
Q
 quotient(int[]) 
Method in class DFA
 Returns the quotient of the DFA by the partition
c
 quotient(Partition) 
Method in class DFA

 quotient(int[]) 
Method in class IDFA

 quotient(Partition) 
Method in class IDFA

 quotientDFT(int[]) 
Method in class DFT
 Returns the quotient of the DFT by the partition
c
 quotientDFT(Partition) 
Method in class DFT

R
 RMinimizer  class RMinimizer.
 Minimization of an acyclic trim automaton in linear time.
 RMinimizer() 
Constructor for class RMinimizer

 radixSort(int[][], int) 
Static method in class EcoRMinimizer
 Lexicographic sort of the array
s
.
 radixSort(int[][], int) 
Method in class RMinimizer
 Lexicographic sort of the array
s
.
 randomFMinimize() 
Method in class IDFA

 refine(String[]) 
Method in class DFT
 Realizes the iteration m=Um+v with operations
in the semiring
(lcp,.,0,\e)
where
m
is a vector of strings, U
the matrix of outputs and v
the vector
of terminal outputs.
 refine(DFA, Partition) 
Method in class NMinimizer
 Refines the partition c.
 refine(IDFA, int[]) 
Method in class NMinimizer

 refine(IDFA, Partition) 
Method in class NMinimizer

 refine(DFA, Partition) 
Method in class NbisMinimizer
 Refines the partition c.
 refine(IDFA, int[]) 
Method in class NbisMinimizer

 refine(IDFA, Partition) 
Method in class NbisMinimizer

 remove(DListInt) 
Method in class DListInt
 Removes the cell
head
in front of the list
and returns it.
 remove() 
Method in class IntQueue
 Removes the first element of the queue.
 remove() 
Method in class PairIntQueue
 Removes the first element of the queue.
 remove(int) 
Method in class VariableArrayTrie
 Removes the entry of index
k
of the array next
.
 removeAll() 
Method in class IntQueue
 Empties the queue.
 removeEdge(int, char) 
Method in class IDFA

 removeFromTrie(String) 
Method in class FixedArrayTrie
 Removes the string s from the trie.
 removeFromTrie(String) 
Method in class ForaxTrie
 Removes the string s from the trie.
 removeFromTrie(String) 
Method in interface Trie
 removes the string s from the trie.
 removeFromTrie(String) 
Method in class VariableArrayTrie
 Removes the string s from the trie.
 removeHead() 
Method in class PairIntQueue
 Returns the first element of the queue and removes it.
 removeVal() 
Method in class IntQueue
 Returns the penultimate value.
 renumber(boolean[]) 
Method in class IDFA
 Gives the new names of the states after eliminating those
such that
b[i] = false
 renumber() 
Method in class State
 Renumbers the states of a NFA.
 renumberStates(int[], int[][], int, int[], IDFA, IDFA) 
Static method in class EcoRMinimizer
 Adds states to the minimal automaton in construction
b
.
 renumberStates(int[], int[][], int, int[], IDFA, IDFA) 
Method in class RMinimizer
 Adds states to the minimal automaton in construction
b
.
 reset() 
Method in class State
 Resets the mark field.
 resetg2l(int) 
Method in class RMinimizer
 Reinitializes the arrays
g2l
and l2g
 reverse() 
Method in class ICFA
 Computes the deterministic automaton (IDFA) obtained by reversing the edges
of a codeterministic automaton (ICFA).
 reverse() 
Method in class IDFA
 Computes the codeterministic automaton (ICFA) obtained by reversing the edges
of a deterministic automaton (IDFA).
S
 SLR  class SLR.
 This class implements the
SLR(0)
method for syntax analysis.
 State  class State.
 Implementation of NFA by linked lists
adapted to Thomson's algorithm.
 State() 
Constructor for class State
 Creates a new state using a name from LinkedNFA.
 saka1() 
Static method in class NFT
 A determinisable NFT.
 saka2() 
Static method in class NFT
 A determinisable NFT.
 saka3() 
Static method in class NFT
 A nondeterminisable NFT.
 saka4() 
Static method in class NFT
 A nondeterminisable NFT.
 scalarProduct(NonNegativeVector) 
Method in class NonNegativeVector
 Computes the scalar product of the vector with
the vector
y
.
 scale(float) 
Method in class NonNegativeVector
 Divides all coordinates of the vector by the factor
r
.
 seizeAll(IntQueue) 
Method in class IntQueue
 Adds all the elements of the queue
s
and empties s
.
 show(Hashtable, int) 
Static method in class Element
 Prints the list of elements of the table
table
whith frequency at least theshold
.
 show(String) 
Method in class IDFA

 show(String) 
Method in class IntList

 show(String) 
Method in class IntQueue

 show(PairInt, String) 
Static method in class PairInt

 show(String) 
Method in class PairInt

 show(Alphabet) 
Method in class PairIntList

 show(String, Alphabet) 
Method in class PairIntList

 show(String, Alphabet) 
Method in class PairIntQueue

 show(Alphabet) 
Method in class PairIntQueue

 showAI(String, Alphabet) 
Method in class PairInt

 showAI(Alphabet) 
Method in class PairInt

 showAI(PairIntList, Alphabet) 
Static method in class PairIntList

 showAI(String, Alphabet) 
Method in class PairIntList

 showAI(String, Alphabet) 
Method in class PairIntQueue

 showAI(Alphabet) 
Method in class PairIntQueue

 showIA(String, Alphabet) 
Method in class PairInt

 showIA(Alphabet) 
Method in class PairInt

 showII(String) 
Method in class PairIntList

 showII() 
Method in class PairIntList

 showWithoutln(String) 
Method in class PairInt

 showWithoutln(String, Alphabet) 
Method in class PairIntList

 sibling(short) 
Method in class Grammar
 Implements the function
Sibling()
.
 size() 
Method in class IntQueue
 Returns the size of the queue.
 size() 
Method in class VariableArrayTrie
 Returns the number of nodes of the trie.
 stabilize(DFA, Partition) 
Method in class HopcroftMinimizer
 This method computes the partition refining
partition
which
is compatible whith the DFA a
.
 stack 
Variable in class LL
 The stack used to store the LR states.
 stack 
Variable in class SLR
 The stack used to store the LR states.
 star(int, String) 
Method in class DFT
 Returns the output from state
q
under input
w
(without regard to terminal states and a possible
terminal output).
T
 ThompsonCompiler  class ThompsonCompiler.
 Compiles a rational expression into an automaton of the
class
NFA
by Thompson's algorithm.  ThompsonCompiler() 
Constructor for class ThompsonCompiler

 Trie  interface Trie.
 Interface for the implementation of the Trie data
structure.
 terminal 
Variable in class FixedArrayTrie
 True if the node is terminal.
 terminal 
Variable in class ICFA
 The terminal state.
 terminal 
Variable in class IDFA
 The array of terminal states.
 terminal 
Variable in class INFA
 The set of terminal states.
 terminal 
Variable in class InfoNFA

 terminal 
Variable in class VariableArrayTrie

 terminals 
Variable in class Grammar
 The terminals.
 to1 
Variable in class State
 The ends of the outgoing edges.
 to2 
Variable in class State
 The ends of the outgoing edges.
 toChar(Set) 
Method in class Alphabet
 Converts to characters the elements of the set of
Short
s
.
 toDFA() 
Method in class NFA
 Implements the determinization algorithm.
 toDFA(Alphabet) 
Method in class VariableArrayTrie

 toDFA2() 
Method in class NFA
 The same as
toDFA
but with an implementation of the
set of states of the resulting DFA
via a HashMap
.
 toDFA3() 
Method in class NFA
 Implements the determinization algorithm.
 toDFAbis(Alphabet) 
Method in class VariableArrayTrie

 toDFT() 
Method in class NFT
 Returns the determinization of the NFA.
 toDawg() 
Method in class ForaxTrie

 toDawg() 
Method in class VariableArrayTrie

 toFile(String, String) 
Static method in class ZLdecode

 toFile(String, String) 
Static method in class ZLencode

 toIDFA(int) 
Method in class ICFA
 Implements the determinization algorithm.
 toIDFA(int) 
Method in class INFA
 Implements the determinization algorithm.
 toIDFA(Alphabet) 
Method in class VariableArrayTrie

 toIDFA2(int) 
Method in class ICFA
 The same as
toIDFA
but with an implementation of the
set of states of the resulting IDFA
via a HashMap
.
 toIDFAbis(Alphabet) 
Method in class VariableArrayTrie
 Creates an IDFA from a trie.
 toInfoDFA() 
Method in class InfoNFA
 Implements the determinization algorithm.
 toLinkedNFA() 
Method in class ThompsonCompiler

 toNFA(String) 
Method in interface ExpressionCompiler
 The function that returns an automaton recognizing the language described by the
input expression.
 toNFA(Alphabet) 
Method in class LinkedNFA
 Converts a LinkedNFA into an NFA.
 toNFA(NFA, State) 
Method in class LinkedNFA
 The recursive call to run
toNFA
.
 toNFA(String) 
Method in class ThompsonCompiler
 Compiles the expression into a nondeterministic finite automaton.
 toShort(char) 
Method in class Alphabet
 Translates the character
c
to a short integer
using the array charToShort
.
 toShort(String) 
Method in class Alphabet
 Translates the String
w
to Short using the method
toShort().
 toString() 
Method in class Alphabet

 toString() 
Method in class DFA

 toString() 
Method in class DFT

 toString() 
Method in class DListInt
 Returns the list ended with a dot.
 toString() 
Method in class Element

 toString() 
Method in class FixedArrayTrie

 toString() 
Method in class ForaxTrie

 toString() 
Method in class Grammar

 toString() 
Method in class HalfEdge
 Overrides the method
toString
 toString() 
Method in class ICFA

 toString() 
Method in class IDFA

 toString() 
Method in class INFA

 toString() 
Method in class IntList

 toString() 
Method in class IntQueue

 toString() 
Method in class LinkedNFA

 toString() 
Method in class NFA

 toString() 
Method in class NonNegativeVector

 toString() 
Method in class PairInt

 toString() 
Method in class Partition
 returns the partition with each class on a line.
 toString() 
Method in class Production

 toString() 
Method in class State

 toString() 
Method in class VariableArrayTrie

 toString(int, int) 
Static method in class ZLencode

 tooLong(Set) 
Method in class NFT
 Returns true if the label of a halfedge in the set
l
exceeds the bound 2 * LmaxOutput() * n * n
.
 transfer(int, int, int) 
Method in class Partition
 Transfers
q
from the class src
to the class dest
.
 transfer(DListInt, int, int) 
Method in class Partition
 Transfers the elements of the list
list
from the class src
to the class dest
.
 transfer(IntList, int, int) 
Method in class Partition

 triParHauteur(int[], IDFA) 
Static method in class EcoRMinimizer
 Returns the array
sh
of queues such that sh[r]
is the queue of states at heigth r
.
 triParHauteur(int[], IDFA) 
Method in class RMinimizer
 Returns the array
sh
of queues such that sh[r]
is the queue of states at heigth r
.
 trim() 
Method in class IDFA
 Computes the trimmed automaton equivalent to a given acyclic
automaton.
V
 VariableArrayTrie  class VariableArrayTrie.
 An implementation of tries with arrays of variable size.
 VariableArrayTrie(char) 
Constructor for class VariableArrayTrie
 Creates a node with label
c
.
 variables 
Variable in class Grammar
 The variables.
 verbose 
Static variable in class BMinimizer

 verbose 
Static variable in class FMinimizer

 verbose 
Static variable in class HopcroftMinimizer
 A boolean flag allowing to set a verbose mode.
 verbose 
Static variable in class NMinimizer

 verbose 
Static variable in class NbisMinimizer

 verbose 
Static variable in class RMinimizer

W
 width() 
Method in class IDFA
 Computes the width (or outdegree) of each state.
 word 
Variable in class Buffer

Z
 ZLdecode  class ZLdecode.
 This class implements the decoding part of the
ZivLempel text compression algorithm.
 ZLdecode() 
Constructor for class ZLdecode

 ZLdecoding(String) 
Static method in class ZLdecode
 Implements
ZLdecoding()
.
 ZLencode  class ZLencode.
 This class implements the encoding part of the
ZivLempel text compression algorithm.
 ZLencode() 
Constructor for class ZLencode

 ZLencoding(Alphabet, String) 
Static method in class ZLencode
 Implements
ZLcoding()
.
A B C D E F G H I L M N O P Q R S T V W Z
Package
Class
Tree
Deprecated
Index
Help
PREV
NEXT
FRAMES
NO FRAMES