Results 201 to 210 of about 18,324 (228)
Some of the next articles are maybe not open access.
Symmetry, Automorphism, and Test
IEEE Transactions on Computers, 1979This paper shows how network symmetries (or the graph-theory concept of automorphism) can be used to cluster faults into classes and thus simplify the process of finding a test set: tests for these automorphic classes are found by classical methods and then expanded using automorphisms to produce a test-set.
Claudine Turcat, André Verdillon
openaire +1 more source
Automorphic functions and automorphic distributions
2011Section 3.2 will provide a short “dictionary” from automorphic distribution theory (in the plane) to automorphic function theory (in II): there is slightly more information in an automorphic distribution than in an automorphic function, so that pairs of automorphic functions have to be used.
openaire +1 more source
Almost Automorphic Integrals of Almost Automorphic Functions
Canadian Mathematical Bulletin, 1972Bochner has introduced the idea of almost automorphy in various contexts (see for example [1] and [2]). We shall use the following definition:A measurable real valued function f of a real variable will be called almost automorphic if from every given infinite sequence of real numbers we can extract a subsequence {αn} such that(i) exits for every real
openaire +1 more source
1990
This cardinal function is not related very much to the preceding ones. To start with, we state some general facts about the size of automorphism groups in BAs; for proofs or references, see the chapter on automorphism groups in the BA handbook.
openaire +1 more source
This cardinal function is not related very much to the preceding ones. To start with, we state some general facts about the size of automorphism groups in BAs; for proofs or references, see the chapter on automorphism groups in the BA handbook.
openaire +1 more source
Automorphisms of Polyadic Automata
Journal of the ACM, 1969This paper is a continuation of the studies of Fleck, Weeg, and others concerning the theory of automorphisms of ordinary automata and of the work of Gil pertaining to time varying automata. A certain restricted class of time-varying automata, namely the class of polyadic automata, is investigated in detail.
openaire +2 more sources
The automorphism group of a certain unbounded non-hyperbolic domain
Journal of Mathematical Analysis and Applications, 2014Atsushi Yamamori
exaly
Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
Journal of Combinatorial Theory Series B, 2006Yan-Quan Feng
exaly
The automorphism group of M0,ntrop and M‾0,ntrop
Journal of Combinatorial Theory - Series A, 2018Alex Abreu
exaly
Symmetries of Riemann surfaces with large automorphism group
Mathematische Annalen, 1974David Singerman
exaly

