Index
- 
-d[eterminize] [In [Out]] | -dgraph [In [Out]] -drgraph [In [Out]]
-dsubset [In [Out]] | -dstate [In [Out]]
 - 
Expr#   m[inimize](Expr)   mh(Expr)   mb(Expr)
 - ! Command
 - $E   containment(E)
 - % Words
 - <any FSA startup option>
 - -a[ccepts] [In] String
 - -aa In | -accept_all In | -raa Regex
 - -approx [In] String
 - -aux Aux
 - -c++ [In] Out
 - -c[ompile] [In [Out]]
 - -c[ompile_to_]c [In [Out]]
 - -cleanup [In [Out]]
 - -cmd Goal
 - -cmdint
 - -complement [In [Out]]
 - -compose A B [Out]
 - -concat A B [Out]]
 - -copy [In [Out]]
 - -count [In [Out]]
 - -cpp [In] Out
 - -davinci [In [Out]]
 - -density [In [Out]]
 - -dict [In [Out]]
 - -diff[erence] A B [Out]
 - -domain [In [Out]]
 - -dot [In [Out]]
 - -efree [In [Out]]
 - -fsa2fsm In Syms Aut | -fsa2fsm [In [Out]]
 - -fsm2fsa [In [Out]]
 - -generate States Syms Dens [JDens]
 - -identical In1 In2
 - -identity [In [Out]]
 - -ignore A B [Out]
 - -intersect A B [Out]
 - -inverse [In [Out]]
 - -java [In] Out
 - -kleene_plus [In [Out]]
 - -kleene_star [In [Out]]
 - -l File
 - -m[inimize] [In [Out]] | -mb [In [Out]] | -mh [In [Out]]
 - -minimum_path [In]
 - -option [In [Out]]
 - -pm File
 - -postscript [In [Out]]
 - -prefix_tree [In [Out]]
 - -produce [In [Out]]
 - -prolog Goal
 - -pstricks_tex [In [Out]] | -pstricks_picture [In [Out]]
 - -r[egex] [Regex] [Out]
 - -range [In [Out]]
 - -reverse [In [Out]]
 - -sample [In [Out]]
 - -t_d[eterminize] [In [Out]]
 - -t_m[inimize] [In [Out]]
 - -tk [File] | -tk [-r Regex]
 - -union A B [Out]]
 - -vcg [In [Out]]
 - -w_d[eterminize] [In [Out]]
 - -w_m[inimize] [In [Out]]
 - ?
 - ?  [Cmd]
 - A x B   cross_product(A,B)   A x B x W
 - A xx B   sl_cross_product(A,B)
 - A!   determinize(A)   determinize(A,Algorithm)
 - A-B   difference(A,B)
 - A::W
 - A:B   pair(A,B)   A:B:Weight
 - Acknowledgements
 - Alias and History
 - Applying Finite Automata
 - Author
 - Combining several auxiliary regular expression operator files
 - Constructing Finite Automata with Regular Expressions
 - Copyright
 - E*   kleene_star(E)
 - E+   [kleene_]plus(E)
 - E0 o E1   compose(E0,E1)
 - Examples
 - Extending the regular expression notation
 - Functionality
 - How to use the toolbox
 - Internal Format of Finite Automata
 - Links
 - List of Predicates
 - Manipulating Finite Automata
 - Papers using FSA
 - Prolog goals
 - References
 - Regular expression syntax
 - S..T
 - Spy Points on Regular expressions
 - Starting and Stopping the command interpreter
 - Syntax
 - Type Coercion
 - Visualizing Finite Automata
 - [E1,E2,...En]   concat(E1,E2)
 - []
 - accessible(A)
 - alias [Name [Val]]
 - b
 - c Files
 - c_with_main
 - cache(Expr)
 - cd [Dir]
 - cleanup(+List0,-List)
 - cleanup(E)
 - cleanup_list_cache
 - coaccessible(A)
 - complement_of_set(+SetOfPreds,+Term,-Complements)
 - complete(A)
 - compose_list([E0,E1,...,En])
 - conjunction(+P0,+P1,?P)
 - convert_pred_module(NewModule,Expr)
convert_pred_module(NewDomainMod,NewRangeMod,Expr)
 - copy_fa(+File0,+File1).
 - count
 - cpp_with_main
 - d
 - debug
 - del(E)
 - det_random(NrStates,NrSymbols,Den,FDens)
 - determinize_preds(+KeyList0,-KeyList)
 - determinize_preds_cache
 - dict2m [In [Out]]
 - dict2ph [In [Out]]
 - display_predicate(+Pred,-Term)
 - display_unused_states
 - domain(E)
 - efree(E)   reachable_efree(E)   co_reachable_efree(E)
 - el Files
 - escape(Sym)
 - evaluate_predicate(+Pred,?Symbol)
 - expand_non_overlapping_predicates(E)
 - fa
 - fa(Fa)
 - fc Files
 - file(X)
 - fl_arbitrary_symbol
 - fl_multiple_symbol_separator
 - fl_multiple_symbol_start
 - fsa_accepts(+String,+Fa)
 - fsa_approx_accepts(+String,+Fa,-Recipe)
 - fsa_approx_transduces(+String0,+Fa,-String)
 - fsa_approx_transduces_w(+String0,+Fa,-Weight)
 - fsa_approx_transduces_wt(+String0,+Fa,-String,-Weight)
 - fsa_array_access(+Index,?Val[,?Default],+FsaArray)
 - fsa_array_get(+Index,?Val,+FsaArray)
 - fsa_array_new(-FsaArray[,?Size])
 - fsa_compile_to_c(+Fa) fsa_compile_to_c(+FileIn,+FileOut)
 - fsa_compile_to_c_fa(+Fa,+FileOut)
 - fsa_compile_to_prolog(+Fa) fsa_compile_to_prolog(+FileIn,+FileOut)
 - fsa_components(?Symbols,?Length,?Starts,?Finals,?Trans,?Jumps,?Fa)
 - fsa_construct([[+Symbols,]+NumberStates,]+Starts,+Finals,+Trans,+Jumps,-Fa)
 - fsa_construct_rename_states([+Symbols,]+Starts,+Finals,+Trans,+Jumps,-Fa)
 - fsa_copy_except(+Key,?Fa0,?Fa1,?Part0,?Part1)
 - fsa_cpp(+FileIn,+FileOut)
 - fsa_davinci(+File0,+File) fsa_davinci(+Fa)
 - fsa_dict_to_fsa(+ListOfStrings,-Fa)
 - fsa_dict_to_fsa_file(+FileIn,+FileOut)
 - fsa_dict_to_perfect_hash(+ListOfStrings,-Fa)
 - fsa_dict_to_perfect_hash_file(+FileIn,+FileOut)
 - fsa_dict_to_trie(+ListOfStrings,-Fa)
 - fsa_dict_to_trie_file(+FileIn,+FileOut)
 - fsa_dot(+File0,+File) fsa_dot(+Fa)
 - fsa_final_state(+Fa,?FinalState)
 - fsa_final_states(?Fa,?FinalStates)
 - fsa_global_decl(?Key,?Help,?Default,?Typical,Val^Goal)
 - fsa_global_get(+Key,?Val)
 - fsa_global_list[-List]
 - fsa_global_set(+Key,?Val)
 - fsa_hash_access(+Key,?Val[,?Default],+FsaHash)
 - fsa_hash_new(-FsaHash[,Size])
 - fsa_hash_to_keylist(+HashedFsaArray,-Keylist)
 - fsa_host_prolog(?Atom)
 - fsa_java(+FileIn,+FileOut)
 - fsa_jump(+Fa,?P,?Q)
 - fsa_jumps(?Fa,?Jumps)
 - fsa_load_aux_file(+File)
 - fsa_m_array_get(+Index,?Val[,?Default],+MutableFsaArray)
 - fsa_m_array_new(-MutableFsaArray,[+Size])
 - fsa_m_array_put(+Index,?Val,+MutableFsaArray)
fsa_m_array_put(+Index,?ValOld,?ValDefault,?Val,+MutableFsaArray)
 - fsa_m_hash_get(+Key,?Val,+MutableFsaHash) 
fsa_m_hash_get(+Key,?Val,?Default,+MutableFsaHash)
 - fsa_m_hash_new(-MutableFsaHash[,Size])
 - fsa_m_hash_put(+Key,?Val,+MutableFsaHash)
fsa_m_hash_put(+Key,?OldVal,?Default,?Val,+MutableFsaHash)
 - fsa_minimum_path(+Fa[,-Path])
 - fsa_minimum_path_array(+Fa,-Array,+Flag)
 - fsa_minimum_path_file(+InFile)
 - fsa_postscript(+File0,+File)
 - fsa_pstricks_picture(+File0,+File)
 - fsa_pstricks_tex(+File0,+File)
 - fsa_read_file([+Format,]+File,?Fa)
 - fsa_reconsult_aux_file(+File)
 - fsa_regex_accepts(+Atom,+String)
 - fsa_regex_approx_accepts(+String,+Regex,-Recipe)
 - fsa_regex_approx_transduces(+String0,+Regex,-String)
 - fsa_regex_approx_transduces_w(+String0,+Regex,-Weight)
 - fsa_regex_approx_transduces_wt(+String0,+Regex,-String,-Weight)
 - fsa_regex_atom_compile(+RegexAtom,+Fa)
 - fsa_regex_atom_compile_file(+RegexAtom,+File)
 - fsa_regex_compile(+Term,-Fa) rx(+Term,-Fa)
 - fsa_regex_compile_file(+Expr,+File)
 - fsa_regex_read_compile(-Fa)
 - fsa_regex_read_compile_file(File)
 - fsa_regex_transduces(+Atom,+String0,?String)
 - fsa_regex_transduces_w(+Atom,+String0,?Weight)
 - fsa_start_state(+Fa,?StartState)
 - fsa_start_states(?Fa,?StartStates)
 - fsa_state(+Fa,?State)
 - fsa_states_number(?Fa,?Integer)
 - fsa_states_set(+Fa,?States)
 - fsa_tcl_directory
 - fsa_transduces(+StringIn,?StringOut,+Fa)
 - fsa_transduces_w(+String,?Weight,+Fa)
 - fsa_transition(+Fa,?P,?Sym,?Q)
 - fsa_transitions(?Fa,?Trans)
 - fsa_type(+Fa,?Type)
 - fsa_u_array_get(+Index,?Val[,?Default,]+UpdatableFsaArray)
 - fsa_u_array_new(-UpdatableFsaArray[,?Size])
 - fsa_u_array_put(+Index[,?OldVal],?Val,+UpdatableFsaArray0,?UpdatableFsaArray)
 - fsa_u_hash_get(+Key,?Val,+UpdatableFsaHash)
 - fsa_u_hash_new(-UpdatableFsaHash[,Size])
 - fsa_u_hash_put(+Key,?Val,+UpdatableFsaHash0,?UpdatableFsaHash)
fsa_u_hash_put(+Key,?OldVal,?Default,?Val,+UpdatableFsaHash0,?UpdatableFsaHash)
 - fsa_vcg(+File0,+File) fsa_vcg(+Fa)
 - fsa_version
 - fsa_visualization(+Format,+Fa)
 - fsa_write_file([+Format,]+File,+Fa)
 - hash_size
 - help [Module [Class [Key]]]
 - id(E)   identity(E)
 - identity(+Pred0,-Pred)
 - ignore(A,B)
 - incomplete(A)
 - ins(E)
 - interactive
 - interpreter
 - intersect[ion](A,B)    A & B
 - intersect_list([E0,E1,...,En])
 - inversion(E)   inverse(E)   invert(E)
 - java_with_main
 - ld Files
 - length_max
 - libc Files
 - libel Files
 - libld Files
 - librc Files
 - libum Files
 - ls
 - map_bbbtree__delete(+Bbbtree0,+Key,-Bbbtree)
 - map_bbbtree__delete_list(+Keys,+Bbbtree0,-Bbbtree)
 - map_bbbtree__empty(?Bbbtree)
 - map_bbbtree__get(+Key,?Val,+Bbbtree)
 - map_bbbtree__init(?Bbbtree)
 - map_bbbtree__largest(+Bbbtree,?Largest,?Val)
 - map_bbbtree__least(+Bbbtree,?Least,?Val)
 - map_bbbtree__list_to_map(+KeyValList,-Bbbtree)
 - map_bbbtree__put(+Key,?Val,+Bbbtree0,-Bbbtree)
 - map_bbbtree__put_list(+Bbbtree0,+KeyValList,-Bbbtree
 - map_bbbtree__remove(+Bbbtree0,+Key,-Bbbtree)
 - map_bbbtree__remove_largest(+Bbbtree0,?Key,?Val,-Bbbtree)
 - map_bbbtree__remove_least(+Bbbtree0,?Key,?Val,-Bbbtree)
 - map_bbbtree__remove_list(+Keys,+Bbbtree0,-Bbbtree)
 - map_bbbtree__size(+Bbbtree,?Size)
 - map_bbbtree__sorted_list_to_map(+SortedKeyValueList,-Bbbtree)
 - map_bbbtree__sorted_list_to_map_len(+SortedKeyValueList,-Bbbtree,+Len)
 - map_bbbtree__to_sorted_list(+Bbbtree,?SortedKeyValList)
 - minimum(+Val0,+Val1,?Min).
 - minimum_only(+YesNo).
 - minus(+Val0,+Val1,?Diff).
 - nd
 - no_display_beyond
 - no_weights(E)
 - nr_sol_max
 - option(E)   E^
 - p [Goal]
 - p[rolog]
 - perfect_hash(ListOfAtoms)
 - plus(+Val0,+Val1,?Sum).
 - postscript_res
 - pragma(ListOfExpressions,E)
 - pred_module
 - prepare_complement_of_set(+Fa,-Term)
 - pstricks_style
 - pwd
 - quit
 - random(NrStates,NrSymbols,Den,JDens[,FDens])
 - range(E)
 - rc Files
 - reachable(A)
 - read
 - regex
 - regex_atom_to_pred(+Atomic,-Pred)
 - regex_cache
 - reverse(E)
 - set_bbbtree__delete(+BbbtreeA,+El,-BbbtreeB
 - set_bbbtree__delete_list(+List,+BbbtreeA,-BbbtreeB)
 - set_bbbtree__difference(+BbbtreeA,+BbbtreeB,-BbbtreeC)
 - set_bbbtree__empty(?Bbbtree)
 - set_bbbtree__equal(+BbbtreeA,+BbbtreeB)
 - set_bbbtree__init(?Bbbtree)
 - set_bbbtree__insert(+BbbtreeA,+El,-BbbtreeB[,?New])
 - set_bbbtree__insert_list(+BbbtreeA,+List,-BbbtreeB)
 - set_bbbtree__intersect(+BbbtreeA,+BbbtreeB,-BbbtreeC)
 - set_bbbtree__is_member(+El,+Bbbtree,?Bool)
 - set_bbbtree__largest(+Bbbtree,?El)
 - set_bbbtree__least(+Bbbtree,?El)
 - set_bbbtree__list_to_set(+List,-Bbbtree)
 - set_bbbtree__member(?El,+Bbbtree)
 - set_bbbtree__non_empty(?Bbbtree)
 - set_bbbtree__power_intersect(+Bbbtrees,-BbbtreeC)
 - set_bbbtree__power_union(+Bbbtrees,-BbbtreeC)
 - set_bbbtree__remove(+BbbtreeA,+El,-BbbtreeB
 - set_bbbtree__remove_largest(+BbbtreeA,?Largest,-BbbtreeB)
 - set_bbbtree__remove_least(+BbbtreeA,?Least,-BbbtreeB)
 - set_bbbtree__remove_list(+List,+BbbtreeA,-BbbtreeB)
 - set_bbbtree__singleton_set(?BbbTree,?El)
 - set_bbbtree__size(+Bbbtree,?Integer)
 - set_bbbtree__sorted_list_to_set(+SortedList,?Bbbtree)
 - set_bbbtree__sorted_list_to_set_len(+SortedList,?Bbbtree,+Len)
 - set_bbbtree__subset(+BbbtreeA,+BbbtreeB)
 - set_bbbtree__superset(+BbbtreeA,+BbbtreeB)
 - set_bbbtree__to_sorted_list(+Bbbtree,?SortedList)
 - set_bbbtree__union(+BbbtreeA,+BbbtreeB,-BbbtreeC)
 - set_random
 - spy [Module] Pred
 - spy(Expr)
 - subs(E)
 - symbol_separator
 - symbol_separator_in
 - symbol_separator_out
 - t_determinize(E)
 - t_determinize_preds(+KeyList0,-KeyList)
 - t_minimize(E)
 - talks_about(+Pred,?Sym)
 - term_complement(E)   `E
 - tk_fsa(+Fa)
 - tk_fsa_add_help_menu
 - tk_fsa_file(+File)
 - tk_regex(+Atom)
 - tk_rx(+Expr)
 - tkconsol
 - to_c_conversion
 - to_cpp_conversion
 - to_java_conversion
 - true(?Pred)
 - um Files
 - v_algorithm
 - v_angle
 - v_tree_depth
 - v_xdist
 - v_ycoord
 - version
 - w_determinize(E)
 - w_determinizer_minimum
 - w_minimize(E)
 - weighted_domain(E)
 - weighted_range(E)
 - weights(E)
 - word(Atom)
 - words(ListOfAtoms)
 - write
 - wt_determinize(E)
 - wt_minimize(E)
 - zero(?Val).
 - {E1,E2,..,En}   union(E1,E2)   set([E1,E2,..,En])
 - {}
 - ~E   complement(E)