Konstantinidis S, Moreira N, Reis R. Generating Error Control Codes With Automata and Transducers. In: Bordihn H, Freund R, Nagy B, Vaszil G, editors. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). Österreichische Computer Gesellschaft; 2016. 2. p. 211-226p. Edit

[2006-41] Konstantinidis S, Silva PV. Maximal Error-Detecting Capabilities of Formal Languages .Edit

Kha\u\i NT, Yakubovich SB. Some two-dimensional integral transformations of convolution type. Dokl. Akad. Nauk BSSR. 1990;34:396-398, 474.Edit

Keskin D, Lomp C. On lifting LE-modules. Vietnam J. Math.. 2002;30:167-176.Edit

Karaçuha S, Lomp C. Integral calculus on quantum exterior algebras. Int. J. Geom. Methods Mod. Phys.. 2014;11:1450026, 20.Edit

[2006-10] Kambites M, Silva PV, Steinberg B. On the rational subset problem for groups .Edit

Kambites M, Silva PV, Steinberg B. On the rational subset problem for groups. J. Algebra. 2007;309:622-639.Edit

[2005-5] Kambites M, Silva PV, Steinberg B. The spectra of lamplighter groups and Cayley machines .Edit

Kambites M, Silva PV, Steinberg B. The spectra of lamplighter groups and Cayley machines. Geom. Dedicata. 2006;120:193-227.Edit

Kalla SL, Luchko Y., Yakubovich SB. The new Leibniz rules and their integral analogues. Internat. J. Math. Statist. Sci.. 1993;2:187-225 (1995).Edit

[2012-21] Kadison L, Young C. SUBALGEBRA DEPTHS WITHIN THE PATH ALGEBRA OF AN ACYCLIC QUIVER .Edit

Kadison L. Odd H-depth and H-separable extensions. Cent. Eur. J. Math.. 2012;10:958-968.

[2012-29] Kadison L. HOPF SUBALGEBRAS AND TENSOR POWERS OF GENERALIZED PERMUTATION MODULES .

Kadison L. Subring depth, Frobenius extensions, and towers. Int. J. Math. Math. Sci.. 2012:Art. ID 254791, 22.

[2012-6] Kadison L. SUBRING DEPTH, FROBENIUS EXTENSIONS AND THEIR TOWERS .

[2010-30] Kadison L. Ideal depth of QF extensions .

Kadison L. Hopf subalgebras and tensor powers of generalized permutation modules. J. Pure Appl. Algebra. 2014;218:367-380.

Jurgensen H, Reis R. Preface. Special Issue - Descriptional Complexity of Formal Languages DCFS 2013. International Journal of Fundations of Computer Science. 2015;25(7):803-805.Edit

Descriptional Complexity of Formal Systems, 15th International Workshop (DCFS 2013). Vol 8031. Jurgensen H, Reis R, editors Springer 2013.Edit

Jordão G, Tavares JN. Mathematical models in cancer therapy. Biosystems. 2017;162:12-23.Edit

Jespers E., Shahzamanian M.. A description of a class of finite semigroups that are near to being Mal\cprime cev nilpotent. J. Algebra Appl.. 2013;12:1250221, 26.Edit

Jespers E., Shahzamanian M.. The non-nilpotent graph of a semigroup. Semigroup Forum. 2012;85:37-57.Edit

Jespers E., Shahzamanian M.. Finite semigroups that are minimal for not being Malcev nilpotent. J. Algebra Appl.. 2014;13:1450063, 22.Edit

Isenhower R., Kant V., Frank T., Pinto CM, Carello C., Turvey M.. Equivalence of Human Odometry by Walk and Run Is Indifferent to Self-Selected Speed. Journal of Motor Behavior. 2012;44:47-52.Edit

Iovanov MC, Kadison L. When weak Hopf algebras are Frobenius. Proc. Amer. Math. Soc.. 2010;138:837-845.Edit