|
|||||||||
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)
top-down 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..]
x
.
a
.
a
computed by Hopcroft's
algorithm.
a
computed by Hopcroft's
algorithm.
a
.
a
.
a
.
a
.
a
.
n
states.
n
states
and k
letters.
n
states
on the alphabet a
.
n
with states.
n
states
and k
letters.
n
states
on the alphabet a
.
O(n^3)
.O(n^3)
.n
times n
matrix.
n
vector with float
coordinates.
NaiveStringMatching(x,y)
of Section 1.2.3.
p
after
reading the word w
.
c
if it exists and
null
otherwise.
next(p,c)
.
Next(c)
if it exists
and null
otherwise.
s
.
w
such that (w,t)
is in the set s
for some terminal state t
.
PairIntList
.
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 context-free 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.
c
c
s
.
s
.
(lcp,.,0,\e)
where
m
is a vector of strings, U
the matrix of outputs and v
the vector
of terminal outputs.
head
in front of the list
and returns it.
k
of the array next
.
b[i] = false
b
.
b
.
g2l
and l2g
SLR(0)
method for syntax analysis.
y
.
r
.
s
and empties s
.
table
whith frequency at least theshold
.
Sibling()
.
partition
which
is compatible whith the DFA a
.
q
under input
w
(without regard to terminal states and a possible
terminal output).
NFA
by Thompson's algorithm. Short
s
.
toDFA
but with an implementation of the
set of states of the resulting DFA
via a HashMap
.
toIDFA
but with an implementation of the
set of states of the resulting IDFA
via a HashMap
.
toNFA
.
c
to a short integer
using the array charToShort
.
w
to Short using the method
toShort().
toString
l
exceeds the bound 2 * LmaxOutput() * n * n
.
q
from the class src
to the class dest
.
list
from the class src
to the class dest
.
sh
of queues such that sh[r]
is the queue of states at heigth r
.
sh
of queues such that sh[r]
is the queue of states at heigth r
.
c
.
ZLdecoding()
.
ZLcoding()
.
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |