A C D E F G H I L M O P R S T U W
All Classes All Packages

A

acceptsTopEventually() - Method in class it.unive.tarsis.automata.Automaton

Yields true if and only if there is at least one transition in this automaton that recognizes a top string.

addState(State) - Method in class it.unive.tarsis.automata.Automaton

Adds a new state to this automaton.

addTransition(State, State, RegularExpression) - Method in class it.unive.tarsis.automata.Automaton

Builds a new transition going from from to to and recognizing input and adds it to the set of transitions of this automaton, without recomputing the outgoing adjacency list.

addTransition(Transition) - Method in class it.unive.tarsis.automata.Automaton

Adds the given transition to the set of transitions of this automaton, without recomputing the outgoing adjacency list.

alphabetUnion(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields the set of regular expressions that represent the union of the alphabets of the two given automata.

areMutuallyReachable(State, State) - Method in class it.unive.tarsis.automata.Automaton

Yields true if and only if the two given states are mutually reachable, that is, if there exist a path going from s1 to s2 and one going from s2 to s1.

asAtom() - Method in class it.unive.tarsis.regex.RegularExpression

Casts this regular expression to an Atom if this regular expression is an Atom.

asChar() - Method in class it.unive.tarsis.strings.ExtChar

Converts this extended character to a normal character.

asComp() - Method in class it.unive.tarsis.regex.RegularExpression

Casts this regular expression to a Comp if this regular expression is a Comp.

asEmptySet() - Method in class it.unive.tarsis.regex.RegularExpression

Casts this regular expression to an EmptySet if this regular expression is an EmptySet.

asOr() - Method in class it.unive.tarsis.regex.RegularExpression

Casts this regular expression to an Or if this regular expression is an Or.

asStar() - Method in class it.unive.tarsis.regex.RegularExpression

Casts this regular expression to a Star if this regular expression is a Star.

Atom - Class in it.unive.tarsis.regex

A regular expression representing a single string.

Atom(String) - Constructor for class it.unive.tarsis.regex.Atom

Builds the atom.

Automata - Class in it.unive.tarsis.automata

Utility class for managing instances of Automaton.

Automata() - Constructor for class it.unive.tarsis.automata.Automata

Automaton - Class in it.unive.tarsis.automata

An automaton, represented as a set of states and a set of transitions.

Automaton(Set<Transition>, Set<State>) - Constructor for class it.unive.tarsis.automata.Automaton

Builds a new automaton.

automatonPrint() - Method in class it.unive.tarsis.automata.Automaton

Yields a textual representation of the adjacency matrix of this automaton.

AutomatonString - Class in it.unive.tarsis

A string modeled through the Tarsis abstract domain.

AutomatonString() - Constructor for class it.unive.tarsis.AutomatonString

Builds a new automaton string recognizing the top string.

AutomatonString(Automaton) - Constructor for class it.unive.tarsis.AutomatonString

Creates a new automaton string with the given automaton.

AutomatonString(String) - Constructor for class it.unive.tarsis.AutomatonString

Builds a new automaton string recognizing the given string.

AutomatonString(String...) - Constructor for class it.unive.tarsis.AutomatonString

Builds a new automaton string recognizing the given string set.

AutomatonString.Interval - Class in it.unive.tarsis

An interval representing the result of a computation on an AutomatonString.

C

clone() - Method in class it.unive.tarsis.automata.Automaton

clone() - Method in class it.unive.tarsis.automata.State

collapse(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields a new automaton that is built by collapsing origin, that is, by merging together subsequent states that are never the root of a branch, the destination of a loop, or that have at least one outgoing transition recognizing the top string.

origin is never modified by this method.

collapseTopChars() - Method in class it.unive.tarsis.strings.ExtString

Yields a new extended string where all subsequent occurrences of the unknown character have been collapsed into a single one.

Comp - Class in it.unive.tarsis.regex

A regular expression representing the sequential composition of two regular expressions.

Comp(RegularExpression, RegularExpression) - Constructor for class it.unive.tarsis.regex.Comp

Builds the comp.

compareTo(ExtString) - Method in class it.unive.tarsis.strings.ExtString

complement(Automaton, Set<RegularExpression>) - Static method in class it.unive.tarsis.automata.Automata

Computes the complement of the given automaton w.r.t the given alphabet.

concat(Automaton...) - Static method in class it.unive.tarsis.automata.Automata

Computes the concatenation between the given automata.

concat(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Computes the concatenation between the two given automata.

concat(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Joins this string with the given one.

concat(RegularExpression) - Method in class it.unive.tarsis.regex.RegularExpression

Joins together two regular expression, that is, it builds a Comp recognizing this regular expression first, and than other.

concat(RegularExpression.PartialSubstring) - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

Joins this partial substring with the given one.

concat(ExtString) - Method in class it.unive.tarsis.strings.ExtString

Joins together two extended strings.

contains(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other is surely contained into this string.

contains(CharSequence) - Method in class it.unive.tarsis.strings.ExtString

Yields true if and only if this extended string contains the given sequence.

contains(String) - Method in class it.unive.tarsis.regex.Atom

contains(String) - Method in class it.unive.tarsis.regex.Comp

contains(String) - Method in class it.unive.tarsis.regex.EmptySet

contains(String) - Method in class it.unive.tarsis.regex.Or

contains(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression always contains the given string.

contains(String) - Method in class it.unive.tarsis.regex.Star

contains(String) - Method in class it.unive.tarsis.regex.TopAtom

D

determinize(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields a deterministic automaton equivalent to the given one.

E

EmptySet - Class in it.unive.tarsis.regex

A regular expression representing the empty set of strings.

endsWith(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other is surely a suffix of this string.

endsWith(String) - Method in class it.unive.tarsis.regex.Atom

endsWith(String) - Method in class it.unive.tarsis.regex.Comp

endsWith(String) - Method in class it.unive.tarsis.regex.EmptySet

endsWith(String) - Method in class it.unive.tarsis.regex.Or

endsWith(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression always ends with the given string.

endsWith(String) - Method in class it.unive.tarsis.regex.Star

endsWith(String) - Method in class it.unive.tarsis.regex.TopAtom

endsWith(String) - Method in class it.unive.tarsis.strings.ExtString

Yields true if and only if this extended string ends with the given suffix.

equals(Object) - Method in class it.unive.tarsis.automata.Automaton

Equal operator between automata, implemented as:
language(A).equals(language(B)) if both automata are loop free, A.contains(B) && B.contains(A) otherwise.

equals(Object) - Method in class it.unive.tarsis.automata.State

equals(Object) - Method in class it.unive.tarsis.automata.Transition

equals(Object) - Method in class it.unive.tarsis.AutomatonString

equals(Object) - Method in class it.unive.tarsis.AutomatonString.Interval

equals(Object) - Method in class it.unive.tarsis.regex.Atom

equals(Object) - Method in class it.unive.tarsis.regex.Comp

equals(Object) - Method in class it.unive.tarsis.regex.EmptySet

equals(Object) - Method in class it.unive.tarsis.regex.Or

equals(Object) - Method in class it.unive.tarsis.regex.RegularExpression

equals(Object) - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

equals(Object) - Method in class it.unive.tarsis.regex.Star

equals(Object) - Method in class it.unive.tarsis.regex.TopAtom

equals(Object) - Method in class it.unive.tarsis.strings.ExtChar

equals(Object) - Method in class it.unive.tarsis.strings.ExtString

equals(Object) - Method in class it.unive.tarsis.strings.TopExtChar

explode() - Method in class it.unive.tarsis.regex.Atom

explode() - Method in class it.unive.tarsis.regex.Comp

explode() - Method in class it.unive.tarsis.regex.EmptySet

explode() - Method in class it.unive.tarsis.regex.Or

explode() - Method in class it.unive.tarsis.regex.RegularExpression

Yields a new regular expression that is the exploded version of this one, that is, where all atoms have been broken down to the composition of the characters that compose their inner strings.

explode() - Method in class it.unive.tarsis.regex.Star

explode() - Method in class it.unive.tarsis.regex.TopAtom

explode(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields a new automaton that is built by exploding the given one, that is, by ensuring that each transition recognizes regular expressions of at most one character (excluding the ones recognizing the top string).

ExtChar - Class in it.unive.tarsis.strings

An extended character, that is, an object that single character.

ExtChar(char) - Constructor for class it.unive.tarsis.strings.ExtChar

Builds the extended character.

extractLongestString(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields the sub-automaton contained in the given one that recognizes only the longest string in the language of a.

ExtString - Class in it.unive.tarsis.strings

An extended string, that is, a string composed of an array of ExtChar.

F

factors(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields the automaton that recognizes all possible substrings of the strings recognized by the given automaton.

findIndexesOf(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.algorithms.IndexFinder

Yields the minimum and maximum indexes where search first appears in automaton.

G

getAllPaths() - Method in class it.unive.tarsis.automata.algorithms.PathExtractor

Yields all possible paths going from an initial state to a final state in the target automaton.

getAllTransitionsConnecting(State, State) - Method in class it.unive.tarsis.automata.Automaton

Yields the set of transitions going from s1 to s2.

getAlphabet() - Method in class it.unive.tarsis.automata.Automaton

Yields the set of regular expressions that represents the alphabet of the symbols recognized by this automaton.

getAutomaton() - Method in class it.unive.tarsis.AutomatonString

Yields the automaton underlying this string.

getCharsToStart() - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

Yields the number of characters to skip before starting to collect the substring.

getDelta() - Method in class it.unive.tarsis.automata.Automaton

Yields the set of transitions contained in this automaton.

getFinalStates() - Method in class it.unive.tarsis.automata.Automaton

Yields the set of final states of this automaton.

getFirst() - Method in class it.unive.tarsis.regex.Comp

Yields the first regular expression.

getFirst() - Method in class it.unive.tarsis.regex.Or

Yields the first regular expression.

getFrom() - Method in class it.unive.tarsis.automata.Transition

Yields the source state of this transition.

getIngoingTransitionsFrom(State) - Method in class it.unive.tarsis.automata.Automaton

Yields the set of all ingoing transitions to the given state.

getInitialState() - Method in class it.unive.tarsis.automata.Automaton

Yields one of the initial states of this automaton.

getInitialStates() - Method in class it.unive.tarsis.automata.Automaton

Yields the set of initial states of this automaton.

getInput() - Method in class it.unive.tarsis.automata.Transition

Yields the symbol recognized by this transition.

getLanguage() - Method in class it.unive.tarsis.automata.Automaton

Yields the language recognized by this automaton, that is, the set of all strings recognized by this automaton.

getLower() - Method in class it.unive.tarsis.AutomatonString.Interval

Yields the lower endpoint of this interval.

getMinimalBrzozowskiRegex(Automaton) - Static method in class it.unive.tarsis.automata.algorithms.RegexExtractor

Yields the minimal regular expression equivalent to the given automaton through the Brozozowski algebraic method.

getMinimalRegex(Automaton) - Static method in class it.unive.tarsis.automata.algorithms.RegexExtractor

Yields the minimal regular expression equivalent to the given automaton.

getMissingChars() - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

Yields the number of missing characters to complete the substring.

getNextStates(State) - Method in class it.unive.tarsis.automata.Automaton

Yields the set of possible successors of the given node.

getOperand() - Method in class it.unive.tarsis.regex.Star

Yields the inner regular expression.

getOutgoingTransitionsFrom(State) - Method in class it.unive.tarsis.automata.Automaton

Yields the set of all outgoing transitions from the given state.

getPathExtractor() - Method in class it.unive.tarsis.automata.Automaton

Yields the path extractor tied to this automaton, that can extract paths from it.

getRegex() - Method in class it.unive.tarsis.AutomatonString

Yields the regular expression that is equivalent to the automaton underlying this string.

getRegexesFromPaths(Automaton) - Static method in class it.unive.tarsis.automata.algorithms.RegexExtractor

Yields the set of regular expressions that can be recognized by the given automaton by extracting one from each path of the automaton.

getSCCs(Automaton) - Static method in class it.unive.tarsis.automata.algorithms.SCCs

Yields the SCCs of the given automaton.

getSecond() - Method in class it.unive.tarsis.regex.Comp

Yields the second regular expression.

getSecond() - Method in class it.unive.tarsis.regex.Or

Yields the second regular expression.

getState() - Method in class it.unive.tarsis.automata.State

Yields the name of this state.

getStates() - Method in class it.unive.tarsis.automata.Automaton

Yields the set of states of this automaton.

getSubstring() - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

Yields the current partial substring.

getTo() - Method in class it.unive.tarsis.automata.Transition

Yields the destination state of this transition.

getUpper() - Method in class it.unive.tarsis.AutomatonString.Interval

Yields the upper endpoint of this interval.

H

hasCycle() - Method in class it.unive.tarsis.automata.Automaton

Yields true if and only if this automaton contains at least one cycle.

hashCode() - Method in class it.unive.tarsis.automata.Automaton

hashCode() - Method in class it.unive.tarsis.automata.State

hashCode() - Method in class it.unive.tarsis.automata.Transition

hashCode() - Method in class it.unive.tarsis.AutomatonString

hashCode() - Method in class it.unive.tarsis.AutomatonString.Interval

hashCode() - Method in class it.unive.tarsis.regex.Atom

hashCode() - Method in class it.unive.tarsis.regex.Comp

hashCode() - Method in class it.unive.tarsis.regex.EmptySet

hashCode() - Method in class it.unive.tarsis.regex.Or

hashCode() - Method in class it.unive.tarsis.regex.RegularExpression

hashCode() - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

hashCode() - Method in class it.unive.tarsis.regex.Star

hashCode() - Method in class it.unive.tarsis.strings.ExtChar

hashCode() - Method in class it.unive.tarsis.strings.ExtString

hasOnlyOnePath() - Method in class it.unive.tarsis.automata.Automaton

Yields true if and only if this automaton has only one path.

I

IndexFinder - Class in it.unive.tarsis.automata.algorithms

An algorithm that finds all possible indexes of the first occurrences of an automaton into another one.

IndexFinder() - Constructor for class it.unive.tarsis.automata.algorithms.IndexFinder

indexOf(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields the AutomatonString.Interval containing all possible indexes where string first appears into this string.

INSTANCE - Static variable in class it.unive.tarsis.regex.EmptySet

The singleton instance.

INSTANCE - Static variable in class it.unive.tarsis.regex.TopAtom

The singleton instance.

INSTANCE - Static variable in class it.unive.tarsis.strings.TopExtChar

The singleton instance.

intersection(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Computes the intersection between the two given automata.

Interval(int, int, boolean) - Constructor for class it.unive.tarsis.AutomatonString.Interval

Builds the interval.

is(char) - Method in class it.unive.tarsis.strings.ExtChar

Yields true if and only if this extended character represent the given one.

is(char) - Method in class it.unive.tarsis.strings.TopExtChar

is(String) - Method in class it.unive.tarsis.regex.Atom

is(String) - Method in class it.unive.tarsis.regex.Comp

is(String) - Method in class it.unive.tarsis.regex.EmptySet

is(String) - Method in class it.unive.tarsis.regex.Or

is(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression corresponds to the given string.

is(String) - Method in class it.unive.tarsis.regex.Star

is(String) - Method in class it.unive.tarsis.regex.TopAtom

isAtomic() - Method in class it.unive.tarsis.regex.Or

Yields true if and only if both inner regular expressions are atoms.

isContained(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields true if and only if first is contained into second, that is, if the language recognized by the intersection between first and the complement of second is empty.

isDeterministic() - Method in class it.unive.tarsis.automata.Automaton

Yields true if and only if this automaton is deterministic, that is, if the transition relation is a function.

isEmpty() - Method in class it.unive.tarsis.regex.Atom

isEmpty() - Method in class it.unive.tarsis.regex.Comp

isEmpty() - Method in class it.unive.tarsis.regex.EmptySet

isEmpty() - Method in class it.unive.tarsis.regex.Or

isEmpty() - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression corresponds to the empty string or to no strings at all.

isEmpty() - Method in class it.unive.tarsis.regex.Star

isEmpty() - Method in class it.unive.tarsis.regex.TopAtom

isEmptyLanguageAccepted(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields true if and only if the given automaton accepts the empty language.

isEpsilonTransition() - Method in class it.unive.tarsis.automata.Transition

Yields true if and only if this transition recognizes only the empty string.

isEqualTo(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if this string is equal to the given one.

isFinalState() - Method in class it.unive.tarsis.automata.State

Yields true if and only if this state is a final state.

isInitialState() - Method in class it.unive.tarsis.automata.State

Yields true if and only if this state is an initial state.

it.unive.tarsis - package it.unive.tarsis

it.unive.tarsis.automata - package it.unive.tarsis.automata

it.unive.tarsis.automata.algorithms - package it.unive.tarsis.automata.algorithms

it.unive.tarsis.regex - package it.unive.tarsis.regex

it.unive.tarsis.strings - package it.unive.tarsis.strings

it.unive.tarsis.util - package it.unive.tarsis.util

IterableArray<E> - Class in it.unive.tarsis.util

An iterable over an array of elements.

IterableArray(E[]) - Constructor for class it.unive.tarsis.util.IterableArray

Builds the iterable.

iterator() - Method in class it.unive.tarsis.strings.ExtString

iterator() - Method in class it.unive.tarsis.util.IterableArray

L

length() - Method in class it.unive.tarsis.AutomatonString

Yields an AutomatonString.Interval containing all possible lengths of the strings modeled by this automaton string.

length() - Method in class it.unive.tarsis.strings.ExtString

Yields the length of this extended string.

lub(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Performs the least upper bound between this string and the given one, without simplifying (i.e., determinizing and minimizing) the result.

lub(AutomatonString, boolean) - Method in class it.unive.tarsis.AutomatonString

Performs the least upper bound between this string and the given one.

M

maxLength() - Method in class it.unive.tarsis.regex.Atom

maxLength() - Method in class it.unive.tarsis.regex.Comp

maxLength() - Method in class it.unive.tarsis.regex.EmptySet

maxLength() - Method in class it.unive.tarsis.regex.Or

maxLength() - Method in class it.unive.tarsis.regex.RegularExpression

Yields the maximum length of this regular expression.

maxLength() - Method in class it.unive.tarsis.regex.Star

maxLength() - Method in class it.unive.tarsis.regex.TopAtom

maxLengthString() - Method in class it.unive.tarsis.automata.Automaton

Yields the length of the longest string recognized by this automaton, with Integer.MAX_VALUE representing infinity.

mayBeEqualTo(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if this string might be equal to the given one.

mayContain(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other might be contained in this string.

mayContain(String) - Method in class it.unive.tarsis.regex.Atom

mayContain(String) - Method in class it.unive.tarsis.regex.Comp

mayContain(String) - Method in class it.unive.tarsis.regex.EmptySet

mayContain(String) - Method in class it.unive.tarsis.regex.Or

mayContain(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression may contain the given string.

mayContain(String) - Method in class it.unive.tarsis.regex.Star

mayContain(String) - Method in class it.unive.tarsis.regex.TopAtom

mayEndWith(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other might be a suffix of this string.

mayEndWith(String) - Method in class it.unive.tarsis.regex.Atom

mayEndWith(String) - Method in class it.unive.tarsis.regex.Comp

mayEndWith(String) - Method in class it.unive.tarsis.regex.EmptySet

mayEndWith(String) - Method in class it.unive.tarsis.regex.Or

mayEndWith(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression may end with the given string.

mayEndWith(String) - Method in class it.unive.tarsis.regex.Star

mayEndWith(String) - Method in class it.unive.tarsis.regex.TopAtom

mayLanguageCheck(Automaton, Automaton, BiFunction<String, String, Boolean>) - Static method in class it.unive.tarsis.automata.Automata

Applies the given comparison function to all the strings of the languages of both automata.

mayStartWith(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other might be a prefix of this string.

mayStartWith(String) - Method in class it.unive.tarsis.regex.Atom

mayStartWith(String) - Method in class it.unive.tarsis.regex.Comp

mayStartWith(String) - Method in class it.unive.tarsis.regex.EmptySet

mayStartWith(String) - Method in class it.unive.tarsis.regex.Or

mayStartWith(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression may start with the given string.

mayStartWith(String) - Method in class it.unive.tarsis.regex.Star

mayStartWith(String) - Method in class it.unive.tarsis.regex.TopAtom

minimize(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields a minimal automaton equivalent to the given one through Brzozowski's minimization algorithm.

minimumDijkstra(State, State) - Method in class it.unive.tarsis.automata.algorithms.PathExtractor

Finds the minimum path between the two given states using the Dijkstra algorithm.

minLength() - Method in class it.unive.tarsis.regex.Atom

minLength() - Method in class it.unive.tarsis.regex.Comp

minLength() - Method in class it.unive.tarsis.regex.EmptySet

minLength() - Method in class it.unive.tarsis.regex.Or

minLength() - Method in class it.unive.tarsis.regex.RegularExpression

Yields the minimum length of this regular expression.

minLength() - Method in class it.unive.tarsis.regex.Star

minLength() - Method in class it.unive.tarsis.regex.TopAtom

mkAutomaton(ExtString) - Static method in class it.unive.tarsis.automata.Automata

Builds an automaton recognizing only the given extended string.

mkAutomaton(String) - Static method in class it.unive.tarsis.automata.Automata

Builds an automaton recognizing only the given string.

mkEmptyLanguage() - Static method in class it.unive.tarsis.automata.Automata

Builds an automaton recognizing no string, that is, recognizing the empty language.

mkEmptyString() - Static method in class it.unive.tarsis.automata.Automata

Builds an automaton recognizing only the empty string.

mkEmptyString() - Static method in class it.unive.tarsis.strings.ExtString

Builds a new empty extend string.

mkString(String) - Static method in class it.unive.tarsis.strings.ExtString

Builds a new extend string corresponding to the given string.

mkStringFromChar(char) - Static method in class it.unive.tarsis.strings.ExtString

Builds a new extend string corresponding to the given character.

mkStrings(String...) - Static method in class it.unive.tarsis.strings.ExtString

Builds an array of extend strings corresponding to the given ones.

mkTopAutomaton() - Static method in class it.unive.tarsis.automata.Automata

Builds an automaton recognizing only the top string.

mkTopString(int) - Static method in class it.unive.tarsis.strings.ExtString

Builds a new extend string composed of length unknown characters.

mustBeContained(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields true if and only if first is always contained into second, that is, if first is a single path automaton and its longest string is contained in all paths (without SCCs).

mustLanguageCheck(Automaton, Automaton, BiFunction<String, String, Boolean>) - Static method in class it.unive.tarsis.automata.Automata

Applies the given comparison function to all the strings of the languages of both automata.

O

Or - Class in it.unive.tarsis.regex

A regular expression representing an or between two other regular expressions.

Or(RegularExpression, RegularExpression) - Constructor for class it.unive.tarsis.regex.Or

Builds the or.

P

PartialSubstring(ExtString, int, int) - Constructor for class it.unive.tarsis.regex.RegularExpression.PartialSubstring

Builds the partial substring.

PathExtractor - Class in it.unive.tarsis.automata.algorithms

An algorithm that extracts paths from an automaton.

PathExtractor(Automaton) - Constructor for class it.unive.tarsis.automata.algorithms.PathExtractor

Builds the extractor.

prefix(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields the automaton that recognizes all possible prefixes of the strings recognized by the given automaton.

R

readableSymbolsFromStates(Set<State>) - Method in class it.unive.tarsis.automata.Automaton

Yields the set of regular expressions that can be read (accepted) by the given set of states.

recomputeOutgoingAdjacencyList() - Method in class it.unive.tarsis.automata.Automaton

Recomputes the outgoing adjacency list of this automaton.

RegexExtractor - Class in it.unive.tarsis.automata.algorithms

An algorithm that extract regular expressions from automata.

RegexExtractor() - Constructor for class it.unive.tarsis.automata.algorithms.RegexExtractor

RegularExpression - Class in it.unive.tarsis.regex

A regular expression that can be recognized by an automaton, or that can be used to represent the language recognized by an automaton.

RegularExpression() - Constructor for class it.unive.tarsis.regex.RegularExpression

RegularExpression.PartialSubstring - Class in it.unive.tarsis.regex

A class that represents an intermediate result of the computation of RegularExpression.substring(int, int).

removeStates(Set<State>) - Method in class it.unive.tarsis.automata.Automaton

Removes every state in the given set from the ones of this automaton, without recomputing the outgoing adjacency list.

removeTransitions(Set<Transition>) - Method in class it.unive.tarsis.automata.Automaton

Removes every transition in the given set from the ones of this automaton, without recomputing the outgoing adjacency list.

removeUnreachableStates() - Method in class it.unive.tarsis.automata.Automaton

Removes all unreachable states from this automaton.

replace(Automaton, Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields a new automaton where all occurrences of strings recognized by toReplace are replaced with the automaton str, assuming that toReplace is finite (i.e., no loops nor top-transitions).

replace(AutomatonString, AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Replaces all occurrences of toReplace into this string with str.

replace(String, Automaton, boolean) - Method in class it.unive.tarsis.automata.algorithms.StringReplacer

Yields a new automaton where every occurrence of toReplace have been replaced with str.

reverse() - Method in class it.unive.tarsis.regex.Atom

reverse() - Method in class it.unive.tarsis.regex.Comp

reverse() - Method in class it.unive.tarsis.regex.EmptySet

reverse() - Method in class it.unive.tarsis.regex.Or

reverse() - Method in class it.unive.tarsis.regex.RegularExpression

Yields a new regular expression that is the reverse of this one.

reverse() - Method in class it.unive.tarsis.regex.Star

reverse() - Method in class it.unive.tarsis.regex.TopAtom

reverse(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Performs the reverse of the given automaton.

S

SCCs - Class in it.unive.tarsis.automata.algorithms

The SCCs of an automaton, represented as a set of sets of states.

SCCs() - Constructor for class it.unive.tarsis.automata.algorithms.SCCs

searchInAllPaths(String) - Method in class it.unive.tarsis.automata.algorithms.StringSearcher

Yields a set containing all the sequences of transitions that recognize the given string.

setFinalState(boolean) - Method in class it.unive.tarsis.automata.State

Updates the property of this state of being a final state according to the given boolean.

setInitialState(boolean) - Method in class it.unive.tarsis.automata.State

Updates the property of this state of being an initial state according to the given boolean.

setState(String) - Method in class it.unive.tarsis.automata.State

Updates the name of this state.

simplify() - Method in class it.unive.tarsis.regex.Atom

simplify() - Method in class it.unive.tarsis.regex.Comp

simplify() - Method in class it.unive.tarsis.regex.EmptySet

simplify() - Method in class it.unive.tarsis.regex.Or

simplify() - Method in class it.unive.tarsis.regex.RegularExpression

Yields a simplified version of this regular expression.

simplify() - Method in class it.unive.tarsis.regex.Star

size() - Method in class it.unive.tarsis.AutomatonString

Yields the size of this string, that is, the number of states of the underlying automaton.

star(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Creates a new automaton composed of a loop over the given automaton.

Star - Class in it.unive.tarsis.regex

A regular expression representing a loop, repeated an arbitrary number of times, over an inner regular expression.

Star(RegularExpression) - Constructor for class it.unive.tarsis.regex.Star

Builds the star.

startsWith(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Yields true if and only if other is surely a prefix of this string.

startsWith(String) - Method in class it.unive.tarsis.regex.Atom

startsWith(String) - Method in class it.unive.tarsis.regex.Comp

startsWith(String) - Method in class it.unive.tarsis.regex.EmptySet

startsWith(String) - Method in class it.unive.tarsis.regex.Or

startsWith(String) - Method in class it.unive.tarsis.regex.RegularExpression

Yields true if and only if this regular expression always starts with the given string.

startsWith(String) - Method in class it.unive.tarsis.regex.Star

startsWith(String) - Method in class it.unive.tarsis.regex.TopAtom

startsWith(String) - Method in class it.unive.tarsis.strings.ExtString

Yields true if and only if this extended string starts with the given prefix.

State - Class in it.unive.tarsis.automata

A state of the automaton.

State(String, boolean, boolean) - Constructor for class it.unive.tarsis.automata.State

Builds a new state.

STRING - Static variable in class it.unive.tarsis.regex.TopAtom

The string used to represent this regular expression.

StringReplacer - Class in it.unive.tarsis.automata.algorithms

An algorithm that replaces strings across all paths of an automaton.

StringReplacer(Automaton) - Constructor for class it.unive.tarsis.automata.algorithms.StringReplacer

Builds the replacer.

StringSearcher - Class in it.unive.tarsis.automata.algorithms

An algorithm that searches strings across all paths of an automaton.

StringSearcher(Automaton) - Constructor for class it.unive.tarsis.automata.algorithms.StringSearcher

Builds the searcher.

substring(int, int) - Method in class it.unive.tarsis.AutomatonString

Yields an automaton string modeling all possible substrings of this automaton string, starting at start (inclusive) and ending at end (exclusive).

substring(int, int) - Method in class it.unive.tarsis.regex.RegularExpression

Returns the set of all possible substrings of this regular expression, starting at the given index (inclusive) and ending at the given index (exclusive).

substringAux(int, int) - Method in class it.unive.tarsis.regex.Atom

substringAux(int, int) - Method in class it.unive.tarsis.regex.Comp

substringAux(int, int) - Method in class it.unive.tarsis.regex.EmptySet

substringAux(int, int) - Method in class it.unive.tarsis.regex.Or

substringAux(int, int) - Method in class it.unive.tarsis.regex.RegularExpression

Returns the set of all possible substrings of this regular expression, starting at the given index (inclusive) and ending at the given index (exclusive).

substringAux(int, int) - Method in class it.unive.tarsis.regex.Star

substringAux(int, int) - Method in class it.unive.tarsis.regex.TopAtom

suffix(Automaton) - Static method in class it.unive.tarsis.automata.Automata

Yields the automaton that recognizes all possible suffixes of the strings recognized by the given automaton.

T

toAutomaton() - Method in class it.unive.tarsis.regex.Atom

toAutomaton() - Method in class it.unive.tarsis.regex.Comp

toAutomaton() - Method in class it.unive.tarsis.regex.EmptySet

toAutomaton() - Method in class it.unive.tarsis.regex.Or

toAutomaton() - Method in class it.unive.tarsis.regex.RegularExpression

Transforms this regular expression into its equivalent automaton.

toAutomaton() - Method in class it.unive.tarsis.regex.Star

toAutomaton() - Method in class it.unive.tarsis.regex.TopAtom

topAsEmptyString() - Method in class it.unive.tarsis.regex.Atom

topAsEmptyString() - Method in class it.unive.tarsis.regex.Comp

topAsEmptyString() - Method in class it.unive.tarsis.regex.EmptySet

topAsEmptyString() - Method in class it.unive.tarsis.regex.Or

topAsEmptyString() - Method in class it.unive.tarsis.regex.RegularExpression

Yields a new regular expression where all TopAtom are assumed to have length zero.

topAsEmptyString() - Method in class it.unive.tarsis.regex.Star

topAsEmptyString() - Method in class it.unive.tarsis.regex.TopAtom

topAsSingleChar() - Method in class it.unive.tarsis.regex.Atom

topAsSingleChar() - Method in class it.unive.tarsis.regex.Comp

topAsSingleChar() - Method in class it.unive.tarsis.regex.EmptySet

topAsSingleChar() - Method in class it.unive.tarsis.regex.Or

topAsSingleChar() - Method in class it.unive.tarsis.regex.RegularExpression

Yields a new regular expression where all TopAtom are assumed to have length one.

topAsSingleChar() - Method in class it.unive.tarsis.regex.Star

topAsSingleChar() - Method in class it.unive.tarsis.regex.TopAtom

TopAtom - Class in it.unive.tarsis.regex

A regular expression representing a sequence of unknown characters of arbitrary length.

TopExtChar - Class in it.unive.tarsis.strings

An ExtChar representing an unknown character.

topIsInfinity() - Method in class it.unive.tarsis.AutomatonString.Interval

Yields true if and only if the upper endpoint of this interval is not finite.

toString() - Method in class it.unive.tarsis.automata.Automaton

toString() - Method in class it.unive.tarsis.automata.State

toString() - Method in class it.unive.tarsis.automata.Transition

toString() - Method in class it.unive.tarsis.AutomatonString.Interval

toString() - Method in class it.unive.tarsis.AutomatonString

toString() - Method in class it.unive.tarsis.regex.Atom

toString() - Method in class it.unive.tarsis.regex.Comp

toString() - Method in class it.unive.tarsis.regex.EmptySet

toString() - Method in class it.unive.tarsis.regex.Or

toString() - Method in class it.unive.tarsis.regex.RegularExpression.PartialSubstring

toString() - Method in class it.unive.tarsis.regex.Star

toString() - Method in class it.unive.tarsis.strings.ExtChar

toString() - Method in class it.unive.tarsis.strings.ExtString

toStrings(Iterable<ExtString>) - Static method in class it.unive.tarsis.strings.ExtString

Builds a set of plain strings from a given set of extended strings.

totalize(Automaton, Set<RegularExpression>) - Static method in class it.unive.tarsis.automata.Automata

Performs the totalization of the given automaton w.r.t the given alphabet.

Transition - Class in it.unive.tarsis.automata

A transition connecting two states of the automaton.

Transition(State, State, RegularExpression) - Constructor for class it.unive.tarsis.automata.Transition

Builds a new transition.

U

union(Automaton...) - Static method in class it.unive.tarsis.automata.Automata

Computes the union between the given automata.

union(Automaton, Automaton) - Static method in class it.unive.tarsis.automata.Automata

Computes the union between the two given automata.

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.Atom

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.Comp

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.EmptySet

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.Or

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.RegularExpression

Yields a new regular expression where all Star have been unrolled to a sequence of their inner regular expression of length length.

unrollStarToFixedLength(int) - Method in class it.unive.tarsis.regex.Star

W

widen(AutomatonString) - Method in class it.unive.tarsis.AutomatonString

Performs the widening between this string and the given one, without simplifying (i.e., determinizing and minimizing) the result, and by automatically determining the threshold parameter.

widen(AutomatonString, boolean) - Method in class it.unive.tarsis.AutomatonString

Performs the widening between this string and the given one, by automatically determining the threshold parameter.

widen(AutomatonString, int) - Method in class it.unive.tarsis.AutomatonString

Performs the widening between this string and the given one, without simplifying (i.e., determinizing and minimizing) the result, and with the given widening threshold.

widen(AutomatonString, int, boolean) - Method in class it.unive.tarsis.AutomatonString

Performs the widening between this string and the given one.

widening(Automaton, int) - Static method in class it.unive.tarsis.automata.Automata

Performs the parametrized widening operation on a.

WIDENING_CAP - Static variable in class it.unive.tarsis.AutomatonString

Maximum widening threshold, or default threshold if there is no difference in the size of the two automata.

A C D E F G H I L M O P R S T U W
All Classes All Packages