/dports/math/gap/gap-4.11.0/lib/ |
H A D | fieldfin.gi | 709 function( aut1, aut2 ) 710 return Source( aut1 ) = Source( aut2 ) and aut1!.power = aut2!.power; 765 function( aut1, aut2 ) 766 if Characteristic( Source( aut1 ) ) 768 return FrobeniusAutomorphismI( Source( aut1 ), 769 aut1!.power * aut2!.power ); 865 function ( aut1, aut2 ) 866 local source1, # source of `aut1' 874 source1:= Source( aut1 ); 889 if gen ^ aut1!.power <> gen ^ aut2!.power then [all …]
|
H A D | fldabnum.gi | 1757 #M \=( <aut1>, <aut2> ) . . . . for automorphisms of abelian number fields 1766 function ( aut1, aut2 ) 1767 return Source( aut1 ) = Source( aut2 ) 1768 and aut1!.galois = aut2!.galois; 1794 #M \<( <aut1>, <aut2> ) . . . . for automorphisms of abelian number fields 1801 function ( aut1, aut2 ) 1802 return Source( aut1 ) < Source( aut2 ) 1803 or ( Source( aut1 ) = Source( aut2 ) 1804 and aut1!.galois < aut2!.galois ); 1945 function ( aut1, aut2 ) [all …]
|
H A D | ghom.gi | 1168 #M CompositionMapping2( <aut1>, <aut2> ) . for two conjugator automorphisms 1174 function( aut1, aut2 ) 1175 if not IsIdenticalObj( Source( aut1 ), Range( aut2 ) ) then 1180 * ConjugatorOfConjugatorIsomorphism( aut1 ) );
|
/dports/math/gap/gap-4.11.0/hpcgap/lib/ |
H A D | fldabnum.gi | 1768 #M \=( <aut1>, <aut2> ) . . . . for automorphisms of abelian number fields 1777 function ( aut1, aut2 ) 1778 return Source( aut1 ) = Source( aut2 ) 1779 and aut1!.galois = aut2!.galois; 1805 #M \<( <aut1>, <aut2> ) . . . . for automorphisms of abelian number fields 1812 function ( aut1, aut2 ) 1813 return Source( aut1 ) < Source( aut2 ) 1814 or ( Source( aut1 ) = Source( aut2 ) 1815 and aut1!.galois < aut2!.galois ); 1956 function ( aut1, aut2 ) [all …]
|
/dports/math/gap/gap-4.11.0/pkg/groupoids-1.68/tst/manual/ |
H A D | gpdaut.tst | 43 gap> aut1 := GroupoidAutomorphismByObjectPerm( Ga4, [-13,-11,-15] );; 44 gap> Display( aut1 ); 49 gap> d1 := ImageElm( aut1, d ); 80 gap> aut1234 := aut1*aut2*aut3*aut4;; 108 gap> aut1 := GroupoidAutomorphismByGroupAuto( Hs3c, a1 ); 116 gap> ImageElm( aut1, a ); 121 gap> ImageElm( aut1, b ); 146 gap> aut := aut1 * aut2 * aut3;
|
/dports/math/gap/gap-4.11.0/pkg/groupoids-1.68/tst/extra/ |
H A D | autos2.tst | 103 gap> aut1 := GroupoidAutomorphismByObjectPerm( Fd8, [-17,-16,-19,-18] ); 109 gap> IsAutomorphismWithObjects( aut1 ); 111 gap> iso1 := isod8 * aut1;; 228 gap> ainv1 := InverseGeneralMapping( aut1 ); 234 gap> aut123 := aut1 * aut2 * aut3;
|
/dports/math/gap/gap-4.11.0/pkg/PatternClass-2.4.2/lib/ |
H A D | automata.gd | 22 #F NDIntersectionAutomaton(aut1,aut2) 31 #F NDUnionAutomata(aut1,aut2) 40 #F NDProductOfLanguages(aut1,aut2)
|
H A D | decomp.gi | 320 #F ClassDirectSum(aut1,aut2) 323 ## class of the direct sum of the regular classes aut1 and aut2.
|
H A D | automata.gi | 22 #F NDIntersectionAutomaton(aut1,aut2) 160 #F NDUnionAutomata(aut1,aut2) 221 #F NDProductOfLanguages(aut1,aut2)
|
H A D | decomp.gd | 142 #F ClassDirectSum(aut1,aut2) 145 ## class of the direct sum of the regular classes aut1 and aut2.
|
/dports/math/gap/gap-4.11.0/pkg/XMod-2.77/lib/ |
H A D | gpd2obj.gi | 168 fact := function(a) local i,j,g,imobs,aut1,autg,aut2,aut; 175 aut1 := GroupoidAutomorphismByObjectPerm( src, imobs ); 178 aut := aut1 * aut2;
|
/dports/math/gap/gap-4.11.0/pkg/XMod-2.77/tst/manual/ |
H A D | gp2obj.tst | 184 gap> aut1 := GroupHomomorphismByImages( d16, d16, [b1,b2], [b1^5,b2] );; 186 gap> aut16 := Group( [ aut1, aut2 ] );; 187 gap> act16 := GroupHomomorphismByImages( sk4, aut16, [b1^4,b2], [aut1,aut2] );;
|
/dports/math/gap/gap-4.11.0/pkg/automata-1.14/gap/ |
H A D | drawgraph.gi | 371 # aut1 := A[1]; 376 # aut1 := A[1];
|
/dports/math/gap/gap-4.11.0/pkg/grape-4.8.3/lib/ |
H A D | grape.g | 4931 local gamma1,gamma2,col1,col2,u,g,i,j,x,aut1,aut2,adj1,adj2,reps1; 4965 aut1:=gamma1.autGroup; 4967 if aut1^perm<>aut2 then 4971 aut1:=Group(()); 4974 # So now, either aut1 and aut2 are both trivial, or they 4976 # and aut1^perm=aut2. 4977 reps1:=GRAPE_OrbitNumbers(aut1,gamma1.order).representatives;
|
/dports/multimedia/mkvtoolnix/mkvtoolnix-65.0.0/po/ |
H A D | pl.po | 15127 msgstr "attachments [opcje] [AID1:aut1 [AID2:aut2 ...]]" 15216 msgstr "cues [opcje] [TID1:aut1 [TID2:aut2 ...]]" 15874 msgstr "timestamps_v2 [TID1:aut1 [TID2:aut2 ...]]" 15909 msgstr "tracks [opcje] [TID1:aut1 [TID2:aut2 ...]]"
|
/dports/math/spot/spot-2.10.2/spot/twaalgos/ |
H A D | are_isomorphic.cc | 47 are_isomorphic_det(const spot::const_twa_graph_ptr aut1, in are_isomorphic_det() argument 52 workqueue.emplace(aut1->get_init_state_number(), in are_isomorphic_det() 54 std::vector<unsigned> map(aut1->num_states(), -1U); in are_isomorphic_det() 55 map[aut1->get_init_state_number()] = aut2->get_init_state_number(); in are_isomorphic_det() 64 for (auto& t : aut1->out(current_state.first)) in are_isomorphic_det() 101 trivially_different(const spot::const_twa_graph_ptr aut1, in trivially_different() argument 104 return aut1->num_states() != aut2->num_states() || in trivially_different() 105 aut1->num_edges() != aut2->num_edges() || in trivially_different() 108 aut1->acc().get_acceptance() != aut2->acc().get_acceptance(); in trivially_different()
|
/dports/math/spot/spot-2.10.2/tests/python/ |
H A D | optionmap.py | 61 aut1 = spot.translate('GF(a <-> XXa)', 'det') variable 62 assert aut1.num_states() == 4
|
H A D | sum.py | 27 aut1 = spot.translate('Xa') variable 31 spot.sum(aut1, aut2)
|
H A D | alternation.ipynb | 34 "aut1, aut2, aut3, aut4, aut5 = spot.automata('''\n", 711 "display_inline(aut1, aut2, aut3, aut4, aut5)" 1404 "display_inline(aut1, aut2, aut3, aut4, aut5, show='.bav1')" 2032 "display_inline(aut1, aut2, aut3, aut4, aut5, show='.bav1u')" 2704 "display_inline(aut1, aut2, aut3, aut4, aut5, show='.bav1us')" 3213 "nba1t = spot.remove_alternation(aut1, True)\n", 3215 "display_inline(aut1.show('.bav1u'), nba1t, nba1)" 3222 …"Let's apply this process to the other 4 automata (which are not very-weak, unlike `aut1`). The s…
|
H A D | stutter-inv.ipynb | 1073 "aut1 = spot.translate(g1)\n", 1074 "aut1.set_name(str(g1))\n", 1075 "spot.highlight_stutter_invariant_states(aut1, g1, 5)\n", 1076 "display(aut1)\n", 1283 "aut = spot.sum(aut1, aut2)\n",
|
/dports/math/spot/spot-2.10.2/tests/core/ |
H A D | explprod.test | 103 ltl2tgba '!a' 'a U b' | autfilt --product=- - > aut1 104 ltl2tgba '!a&b' | autfilt -q --equivalent-to=aut1
|
H A D | ltldo2.test | 34 ltldo 'ltl2tgba -D' ltl2tgba -f 'Ga | Gb | Gc' --smallest=%n > aut1.hoa 36 diff aut1.hoa aut2.hoa
|
H A D | uniq.test | 24 randaut a b -Q5 --hoa > aut1 26 autfilt --randomize aut1 --hoa > rand11 27 autfilt --randomize --seed=1 aut1 --hoa > rand12 28 autfilt --randomize --seed=2 aut1 --hoa > rand13 33 cat aut1 aut2 > aut 34 cat aut1 aut2 rand11 rand12 rand13 rand21 rand22 rand23 > all
|
/dports/math/spot/spot-2.10.2/ |
H A D | NEWS | 1571 - aut1->exclusive_word(aut2) is a new method that returns a word 1572 accepted by aut1 or aut2 but not both. The exclusive_run()
|
/dports/math/spot/spot-2.10.2/doc/org/ |
H A D | tut90.org | 68 : aut1: a=0 b=1 96 : aut1: a=0 b=1 108 aut1 = spot.make_twa_graph() 109 ap1a = aut1.register_ap("a") 110 ap1b = aut1.register_ap("b") 120 : aut1: a=0 b=1 121 : aut1: a=0 b=1 c=2 146 std::cout << "aut1@" << aut1 << ": a=" << ap1a << " b=" << ap1b << '\n'; 155 aut1 = nullptr; 167 aut1@0x55bff3d24340: a=0 b=1 [all …]
|