Gotowa bibliografia na temat „Monoid”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Monoid”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Monoid"

1

Ceccherini-Silberstein, Tullio, and Michel Coornaert. "On surjunctive monoids." International Journal of Algebra and Computation 25, no. 04 (2015): 567–606. http://dx.doi.org/10.1142/s0218196715500113.

Pełny tekst źródła
Streszczenie:
A monoid M is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of marked surjunctive monoids is itself surjunctive. On the other hand, we show that the bicyclic monoid and, more generally, all monoids containing a submonoid isomorphic to the bicyclic monoid are non-sur
Style APA, Harvard, Vancouver, ISO itp.
2

Kim, Hwankoo, Myeong Og Kim, and Young Soo Park. "Some Characterizations of Krull Monoids." Algebra Colloquium 14, no. 03 (2007): 469–77. http://dx.doi.org/10.1142/s1005386707000429.

Pełny tekst źródła
Streszczenie:
In this paper, Kaplansky-type theorems are given to characterize GCD-monoids and valuation monoids. Also, (unique) r-factorable monoids are defined and it is shown that S is a Krull monoid if and only if S is a unique t-factorable (resp., w-factorable) monoid if and only if S is a t-factorable (resp., w-factorable) t-Prüfer monoid.
Style APA, Harvard, Vancouver, ISO itp.
3

Lee, Edmond. "Varieties generated by 2-testable monoids." Studia Scientiarum Mathematicarum Hungarica 49, no. 3 (2012): 366–89. http://dx.doi.org/10.1556/sscmath.49.2012.3.1211.

Pełny tekst źródła
Streszczenie:
The smallest monoid containing a 2-testable semigroup is defined to be a 2-testable monoid. The well-known Brandt monoid B21 of order six is an example of a 2-testable monoid. The finite basis problem for 2-testable monoids was recently addressed and solved. The present article continues with the investigation by describing all monoid varieties generated by 2-testable monoids. It is shown that there are 28 such varieties, all of which are finitely generated and precisely 19 of which are finitely based. As a comparison, the sub-variety lattice of the monoid variety generated by the monoid B21 i
Style APA, Harvard, Vancouver, ISO itp.
4

Polo, Harold. "Approximating length-based invariants in atomic Puiseux monoids." Algebra and Discrete Mathematics 33, no. 1 (2022): 128–39. http://dx.doi.org/10.12958/adm1760.

Pełny tekst źródła
Streszczenie:
A numerical monoid is a cofinite additive submonoid of the nonnegative integers, while a Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. Using that a Puiseux monoid is an increasing union of copies of numerical monoids, we prove that some of the factorization invariants of these two classes of monoids are related through a limiting process. This allows us to extend results from numerical to Puiseux monoids. We illustrate the versatility of this technique by recovering various known results about Puiseux monoids.
Style APA, Harvard, Vancouver, ISO itp.
5

García-García, Juan Ignacio, Daniel Marín-Aragón, and Alberto Vigneron-Tenorio. "On Ideals of Submonoids of Power Monoids." Mathematics 13, no. 4 (2025): 584. https://doi.org/10.3390/math13040584.

Pełny tekst źródła
Streszczenie:
Let S be a numerical monoid, while a Pfin(S)-monoid S is a monoid generated by a finite number of finite non-empty subsets of S. That is, S is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. This work provides an algorithm for computing the ideals associated with some Pfin(S)-monoids. These are the key to studying some factorization properties of Pfin(S)-monoids and some additive properties of sumsets. This approach links computational commutative algebra with additive number theory.
Style APA, Harvard, Vancouver, ISO itp.
6

Huang, W., and J. Li. "Affinely spanned quasi-stochastic algebraic monoids." International Journal of Algebra and Computation 27, no. 08 (2017): 1061–72. http://dx.doi.org/10.1142/s0218196717500497.

Pełny tekst źródła
Streszczenie:
A linear algebraic monoid over an algebraically closed field [Formula: see text] of characteristic zero is called (row) quasi-stochastic if each row of each matrix element is of sum one. Any linear algebraic monoid over [Formula: see text] can be embedded as an algebraic submonoid of the maximum affinely spanned quasi-stochastic monoid of some degree [Formula: see text]. The affinely spanned quasi-stochastic algebraic monoids form a basic class of quasi-stochastic algebraic monoids. An initial study of structure of affinely spanned quasi-stochastic algebraic monoids is conducted. Among other t
Style APA, Harvard, Vancouver, ISO itp.
7

Cain, Alan J., and António Malheiro. "Deciding conjugacy in sylvester monoids and other homogeneous monoids." International Journal of Algebra and Computation 25, no. 05 (2015): 899–915. http://dx.doi.org/10.1142/s0218196715500241.

Pełny tekst źródła
Streszczenie:
We give a combinatorial characterization of conjugacy in the sylvester monoid, showing that conjugacy is decidable for this monoid. We then prove that conjugacy is undecidable in general for homogeneous monoids and even for multihomogeneous monoids.
Style APA, Harvard, Vancouver, ISO itp.
8

Schwab, Emil Daniel. "Gauge Inverse Monoids." Algebra Colloquium 27, no. 02 (2020): 181–92. http://dx.doi.org/10.1142/s1005386720000152.

Pełny tekst źródła
Streszczenie:
The paper introduces a class of inverse (sub)monoids which contains Jones–Lawson’s gauge inverse (sub)monoid. The aim is to give examples and the basic properties of these monoids. Jones–Lawson’s gauge inverse monoid, as an inverse submonoid of the polycyclic monoid, is the prototype in our development line. The generalization leads also to Meakin–Sapir type results involving bijections between special congruences and special wide inverse submonoids.
Style APA, Harvard, Vancouver, ISO itp.
9

Cain, Alan J., António Malheiro, and Fábio M. Silva. "The monoids of the patience sorting algorithm." International Journal of Algebra and Computation 29, no. 01 (2019): 85–125. http://dx.doi.org/10.1142/s0218196718500649.

Pełny tekst źródła
Streszczenie:
The left patience sorting ([Formula: see text][Formula: see text]PS) monoid, also known in the literature as the Bell monoid, and the right patient sorting ([Formula: see text]PS) monoid are introduced by defining certain congruences on words. Such congruences are constructed using insertion algorithms based on the concept of decreasing subsequences. Presentations for these monoids are given. Each finite-rank [Formula: see text]PS monoid is shown to have polynomial growth and to satisfy a nontrivial identity (dependent on its rank), while the infinite rank [Formula: see text]PS monoid does not
Style APA, Harvard, Vancouver, ISO itp.
10

Behrisch, Mike, and Edith Vargas-García. "Centralising Monoids with Low-Arity Witnesses on a Four-Element Set." Symmetry 13, no. 8 (2021): 1471. http://dx.doi.org/10.3390/sym13081471.

Pełny tekst źródła
Streszczenie:
As part of a project to identify all maximal centralising monoids on a four-element set, we determine all centralising monoids witnessed by unary or by idempotent binary operations on a four-element set. Moreover, we show that every centralising monoid on a set with at least four elements witnessed by the Mal’cev operation of a Boolean group operation is always a maximal centralising monoid, i.e., a co-atom below the full transformation monoid. On the other hand, we also prove that centralising monoids witnessed by certain types of permutations or retractive operations can never be maximal.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Monoid"

1

Render, Elaine. "Rational monoid and semigroup automata." Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/rational-monoid-and-semigroup-automata(0aff0c17-b6f9-4bc8-95d1-ff98da059d42).html.

Pełny tekst źródła
Streszczenie:
We consider a natural extension to the definition of M-automata which allows the automaton to make use of more of the structure of the monoid M, and by removing the reliance on an identity element, allows the definition of S-automata for S an arbitrary semigroup. In the case of monoids, the resulting automata are equivalent to valence automata with rational target sets which arise in the theory of regulated rewriting. We focus on the polycyclic monoids, and show that for polycyclic monoids of rank 2 or more they accept precisely the context-free languages. The case of the bicyclic monoid is al
Style APA, Harvard, Vancouver, ISO itp.
2

Cevik, Ahmet Sinan. "Minimality of group and monoid presentations." Thesis, University of Glasgow, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284692.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Salt, Brittney M. "MONOID RINGS AND STRONGLY TWO-GENERATED IDEALS." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/31.

Pełny tekst źródła
Streszczenie:
This paper determines whether monoid rings with the two-generator property have the strong two-generator property. Dedekind domains have both the two-generator and strong two-generator properties. How common is this? Two cases are considered here: the zero-dimensional case and the one-dimensional case for monoid rings. Each case is looked at to determine if monoid rings that are not PIRs but are two-generated have the strong two-generator property. Full results are given in the zero-dimensional case, however only partial results have been found for the one-dimensional case.
Style APA, Harvard, Vancouver, ISO itp.
4

Lima, Lucinda Maria de Carvalho. "The local automorphism monoid of an independence algebra." Thesis, University of York, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358341.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Catarino, Paula Maria Machado Cruz. "The monoid of orientation-preserving mappings on a chain." Thesis, University of Essex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266839.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Oltmanns, Helga. "Homological classification of monoids by projectivities of right acts." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960378634.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ramasu, Pako. "Internal monoid actions in a cartesian closed category and higher-dimensional group automorphisms." Doctoral thesis, University of Cape Town, 2015. http://hdl.handle.net/11427/20248.

Pełny tekst źródła
Streszczenie:
The notion of cat¹-group which was introduced by Loday is equivalent to the notions of crossed module and of internal category in the category of groups. This notion of cat¹-groups and their morphisms admits natural generalization to catⁿ-groups, which give rise to n-fold categories in the category of groups. There is also a characterization of catⁿ-groups in terms of crossed n-cubes which was given by Ellis and Steiner. The category Catⁿ (Groups) of internal n-fold categories in the category of groups is a cartesian closed category, however given an object X in Catⁿ (Groups), calculating corr
Style APA, Harvard, Vancouver, ISO itp.
8

Duchamp, Gérard. "Algorithmes sur les polynomes en variables non commutatives." Paris 7, 1987. http://www.theses.fr/1987PA077069.

Pełny tekst źródła
Streszczenie:
Etude des monoides libres et de leurs algebres. Presentation de nouvelles caracterisations des bisections reconnaissables; de la caracterisation des mots pouvant appartenir au support d'un polynome de lie et de l'etude de quelques proprietes algebriques de polynomes en variables partiallement commutatives. Etude du treillis des congruences regulieres sur le monoide bicyclique
Style APA, Harvard, Vancouver, ISO itp.
9

Tesson, Emilie. "Un hybride du groupe de Thompson F et du groupe de tresses B°°." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMC212/document.

Pełny tekst źródła
Streszczenie:
Nous étudions un certain monoïde défini par une présentation, notée P, qui est un hybride de celles du monoïde de tresses infinies et du monoïde de Thompson. Pour cela, nous utilisons plusieurs approches. On décrit d’abord un système de réécriture convergent pour la présentation P, ce qui fournit en particulier une solution au problème de mots de P et rapproche le monoïde hybride du monoïde de Thompson. Puis, suivant le modèle du monoïde de tresses, on utilise la méthode du retournement de facteur pour analyser la relation de divisibilité à gauche, et montrer en particulier q
Style APA, Harvard, Vancouver, ISO itp.
10

East, James Phillip Hinton. "On Monoids Related to Braid Groups and Transformation Semigroups." School of Mathematics and Statistics, 2006. http://hdl.handle.net/2123/2438.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Monoid"

1

Debré, P., and P. Debré. Jacques Monod. Flammarion, 1996.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Renner, Lex Ellery. Linear algebraic monoids. Springer, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Putcha, Mohan S. Linear algebraic monoids. Cambridge University Press, 1988.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Cegarra, Antonio M., and Jonathan Leech. The Cohomology of Monoids. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-50258-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Brusse, Jacques. Ambroise Monod, le Recup'Art. Ereme, 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Badawi, Ayman, and Jim Coykendall, eds. Rings, Monoids and Module Theory. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-8422-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Steinberg, Benjamin. Representation Theory of Finite Monoids. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43932-7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Wagener, Gerda. Die Mondin. Ellermann, 1988.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Hureau, J. C. Le siècle de Théodore Monod. Muséum national d'histoire naturelle, 2002.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Vray, Nicole. Théodore Monod, une vie spirituelle. Actes sud, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Monoid"

1

Bruns, Winfried, and Joseph Gubeladze. "Monoid algebras." In Springer Monographs in Mathematics. Springer New York, 2009. http://dx.doi.org/10.1007/b105283_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Akin, Ethan. "Monoid Actions." In Recurrence in Topological Dynamics. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2668-8_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Duplij, Steven, Steven Duplij, Paulius Miškinis, et al. "Free Monoid." In Concise Encyclopedia of Supersymmetry. Springer Netherlands, 2004. http://dx.doi.org/10.1007/1-4020-4522-0_203.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lozano, Yolanda, Steven Duplij, Malte Henkel, et al. "Semigroup (Monoid)." In Concise Encyclopedia of Supersymmetry. Springer Netherlands, 2004. http://dx.doi.org/10.1007/1-4020-4522-0_484.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Johansen, Pål Hermunn, Magnus Løberg, and Ragni Piene. "Monoid Hypersurfaces." In Geometric Modeling and Algebraic Geometry. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-72185-7_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Hunt, John. "Monoid Pattern." In Scala Design Patterns. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02192-8_38.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Colcombet, Thomas, Sam van Gool, and Rémi Morvan. "First-order separation over countable ordinals." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_14.

Pełny tekst źródła
Streszczenie:
AbstractWe show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on $$\omega $$ ω -words. For this, we develop the algebraic concept of monoid (resp. $$\omega $$ ω -semigroup, resp. ordinal monoid) with aperiodic merge, an extension of monoids (resp. $$\omega $$ ω -semigroup, resp. ordinal monoid) that explicitly includes a new operation capturing the loss of precision induced by first-order indistinguishability. We also show
Style APA, Harvard, Vancouver, ISO itp.
8

Dehornoy, Patrick. "The Geometry Monoid." In Braids and Self-Distributivity. Birkhäuser Basel, 2000. http://dx.doi.org/10.1007/978-3-0348-8442-6_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Czaja, Ludwik. "Monoid of Processes." In Cause-Effect Structures. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-20461-7_11.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Duplij, Steven, Joshua Feinberg, Moshe Moshe, et al. "Bicyclic Semigroup (Monoid)." In Concise Encyclopedia of Supersymmetry. Springer Netherlands, 2004. http://dx.doi.org/10.1007/1-4020-4522-0_61.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Monoid"

1

Csapó, Ádám B. "MonoSR: A Monoidal-Monad Pattern for Bridging Gaps in Developer Communication and Code Semantics." In 2024 IEEE 15th International Conference on Cognitive Infocommunications (CogInfoCom). IEEE, 2024. https://doi.org/10.1109/coginfocom63007.2024.10894741.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Yan, Longfei, Pei Yan, Shengzhou Xiong, Xuanyu Xiang, and Yihua Tan. "MonoCD: Monocular 3D Object Detection with Complementary Depths." In 2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2024. http://dx.doi.org/10.1109/cvpr52733.2024.00976.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Zhang, Ziteng, Wenyu Li, Sidun Liu, Peng Qiao, and Yong Dou. "MonoIR: Inpainting and Reconstruction for Monocular Endoscope Deformation Scenes." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10889730.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Agarwal, Sarita. "Homomorphism in ternary monoid." In 5th INTERNATIONAL CONFERENCE ON CURRENT SCENARIO IN PURE AND APPLIED MATHEMATICS (ICCSPAM-2022). AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0137094.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

DELGADO, MANUEL, and VíTOR H. FERNANDES. "ABELIAN KERNELS, SOLVABLE MONOIDS AND THE ABELIAN KERNEL LENGTH OF A FINITE MONOID." In Proceedings of the Workshop. WORLD SCIENTIFIC, 2004. http://dx.doi.org/10.1142/9789812702616_0005.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Rosales, José Carlos, Pedro A. García-Sánchez, and Juan Ignacio García-García. "How to check if a finitely generated commutative monoid is a principal ideal commutative monoid." In the 2000 international symposium. ACM Press, 2000. http://dx.doi.org/10.1145/345542.345655.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Andrade, Antonio, and Tariq Shah. "Ascending chains of monoid and encoding." In XXXI Simpósio Brasileiro de Telecomunicações. Sociedade Brasileira de Telecomunicações, 2013. http://dx.doi.org/10.14209/sbrt.2013.159.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Muthuraji, T., A. Anbukkarasi, and T. Soupramanien. "Commutative Monoids and Monoid homomorphism on Lukasiwicz conjunction and disjunction operators over neutrosophic fuzzy matrices." In 3RD INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS (e-ICMTA-2022). AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0164778.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Vemuri, Nageswara Rao, and Balasubramaniam Jayaram. "Homomorphisms on the monoid of fuzzy implications." In 2013 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2013. http://dx.doi.org/10.1109/fuzz-ieee.2013.6622436.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Andrade, Antonio, and Tariq Shah. "Ascending chain of monoid rings and encoding." In XXIX Simpósio Brasileiro de Telecomunicações. Sociedade Brasileira de Telecomunicações, 2011. http://dx.doi.org/10.14209/sbrt.2011.5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Monoid"

1

Raychev, Nikolay. Hyper-n-Dimensional Neural Network Model with Desargues Monoids. Web of Open Science, 2020. http://dx.doi.org/10.37686/emj.v1i1.28.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wayland, B. B. Catalytic hydrogenation of carbon monoxide. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/5260923.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Sawruk, Nicholas W. Optically Pumped Carbon Monoxide Cascade Laser. Defense Technical Information Center, 2005. http://dx.doi.org/10.21236/ada437976.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Geoffroy, G. L. Mechanistic studies of carbon monoxide reduction. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/6178880.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Krause, Travis R., Joseph G. Sebranek, and Mark S. Honeyman. Carbon Monoxide Packaging for Fresh Pork. Iowa State University, 2004. http://dx.doi.org/10.31274/ans_air-180814-70.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pitts, William M. Carbon monoxide production in compartment fires:. National Institute of Standards and Technology, 1994. http://dx.doi.org/10.6028/nist.ir.5568.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Persily, Andrew K. Carbon monoxide dispersion in residential buildings:. National Institute of Standards and Technology, 1996. http://dx.doi.org/10.6028/nist.ir.5906.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Springston, Stephen. Carbon Monoxide Analyzer (CO-ANALYZER) Instrument Handbook. Office of Scientific and Technical Information (OSTI), 2015. http://dx.doi.org/10.2172/1495422.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Biraud, S. CO (Carbon Monoxide Mixing Ratio System) Handbook. Office of Scientific and Technical Information (OSTI), 2011. http://dx.doi.org/10.2172/1019542.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Linteris, Gregory T., Marc D. Rumminger, and Valeri Babushok. Premixed carbon monoxide-nitrous oxide-hydrogen flames :. National Institute of Standards and Technology, 1999. http://dx.doi.org/10.6028/nist.ir.6374.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!