Results 151 to 160 of about 3,653,792 (195)
Intrinsic Quantization of Linear Hamiltonian Systems. [PDF]
Entropy (Basel)Accardi L, Pandiscia C.
europepmc +1 more source
A Fourier-Jacobi Dirichlet series for cusp forms on orthogonal groups. [PDF]
Res Number TheoryPsyroukis R.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fuzzy Sets and Systems, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fang-Fang Pan, Sheng-Wei Han
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fang-Fang Pan, Sheng-Wei Han
openaire +1 more source
Journal of Cybernetics, 1976
Abstract Virtually all algebraic approaches to formal language theory involve an intervening notion of machine, and it is the machine theory which is treated algebraically. The present article details a direct algebraic treatment of context-free languages by means of the recently-developed theory of hetrogeneous algebras.
Hatcher, W. S., Rus, T.
openaire +2 more sources
Abstract Virtually all algebraic approaches to formal language theory involve an intervening notion of machine, and it is the machine theory which is treated algebraically. The present article details a direct algebraic treatment of context-free languages by means of the recently-developed theory of hetrogeneous algebras.
Hatcher, W. S., Rus, T.
openaire +2 more sources
On Polynomial Algebras and Free Algebras
Canadian Journal of Mathematics, 1968It is well known that given the polynomial algebra (for definitions, see §2), an algebra of type τ, and a sequence a of elements of , one can define a congruence relation θa of such that the factor algebra is isomorphic to the subalgebra of generated by a, and the isomorphism is given in a very simple way.
openaire +2 more sources
Canadian Journal of Mathematics, 1985
For us an “algebra” is a finitary “universal algebra” in the sense of G. Birkhoff [9]. We are concerned in this paper with algebras whose endomorphisms are determined by small subsets. For example, an algebra A is rigid (in the strong sense) if the only endomorphism on A is the identity idA. In this case, the empty set determines the endomorphism set E(
Bankston, Paul, Schutt, Richard
openaire +2 more sources
For us an “algebra” is a finitary “universal algebra” in the sense of G. Birkhoff [9]. We are concerned in this paper with algebras whose endomorphisms are determined by small subsets. For example, an algebra A is rigid (in the strong sense) if the only endomorphism on A is the identity idA. In this case, the empty set determines the endomorphism set E(
Bankston, Paul, Schutt, Richard
openaire +2 more sources
Free Nilpotent Minimum Algebras
Mathematical Logic Quarterly, 2006 AbstractIn the present paper we give a description of the free algebra over an arbitrary set of generators in the variety of nilpotent minimum algebras. Such description is given in terms of a weak Boolean product of directly indecomposable algebras over the Boolean space corresponding to the Boolean subalgebra of the free NM‐algebra. (© 2006 WILEY‐VCH
Manuela Busaniche
exaly +5 more sources
International Journal of Algebra and Computation, 2000
A ternary algebra is a bounded distributive lattice with additonal operations e and ~ that satisfies (a+b)~=a~b~, a~~=a, e≤a+a~, e~= e and 0~=1. This article characterizes free ternary algebras by giving necessary and sufficient conditions on a set X of free generators of a ternary algebra L, so that X freely generates L.
openaire +2 more sources
A ternary algebra is a bounded distributive lattice with additonal operations e and ~ that satisfies (a+b)~=a~b~, a~~=a, e≤a+a~, e~= e and 0~=1. This article characterizes free ternary algebras by giving necessary and sufficient conditions on a set X of free generators of a ternary algebra L, so that X freely generates L.
openaire +2 more sources
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers.
openaire +1 more source
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic with the set of natural numbers.
openaire +1 more source
Algebra and Logic, 1988
This work is based on the results and methods of the author's earlier study of Jordan \(A\)-algebras [Algebra Logika 26, No. 6, 731--755 (1987; Zbl 0648.17008)]. The term algebra is used when working over a commutative associative ring with \(1/2\), while the term ring is used when working over the integers.
openaire +2 more sources
This work is based on the results and methods of the author's earlier study of Jordan \(A\)-algebras [Algebra Logika 26, No. 6, 731--755 (1987; Zbl 0648.17008)]. The term algebra is used when working over a commutative associative ring with \(1/2\), while the term ring is used when working over the integers.
openaire +2 more sources