# Publications

Found 213 results
[ Author] Title Type Year
Filters: First Letter Of Last Name is B  [Clear All Filters]
B
When δ-semiperfect rings are semiperfect. Turkish J. Math.. 2010;34:317-324.Edit
Rings whose modules are weakly supplemented are perfect. Applications to certain ring extensions. Math. Scand.. 2009;105:25-30.Edit
On a recent generalization of semiperfect rings. Bull. Aust. Math. Soc.. 2008;78:317-325.Edit
On irreducible subgroups of simple algebraic groups. Mathematische Annalen. 2017;367(3-4):1259-1309.Edit
Irreducible almost simple subgroups of classical algebraic groups. Memoirs of the American Mathematical Society. 2015;236:vi+110.Edit
On subgroup depth. Int. Electron. J. Algebra. 2011;9:133-166.Edit
Subgroups of depth three. In: Surveys in differential geometry. Volume XV. Perspectives in mathematics and physics. Vol 15. Int. Press, Somerville, MA; 2011. 1. p. 17-36p. Edit
Minimal presentations for monoids with the ascending chain condition on principal ideals. Semigroup Forum. 2012;85:185-190.Edit
Non-commutative integral forms and twisted multi-derivations. J. Noncommut. Geom.. 2010;4:289-312.Edit
Integral Appell $F_3$-transformation with respect to parameters. In: Complex analysis and applications '85 (Varna, 1985). Publ. House Bulgar. Acad. Sci., Sofia; 1986. 1. p. 135-140p. Edit
Partitions of a finite Boolean lattice into intervals. European J. Combin.. 2009;30:1801-1809.Edit
Position automaton construction for regular expressions with intersection. In: Reutenauer C, Brlek S, editors. Developments in Language Theory - 20th International Conference, DLT 2016. Vol 9840. Springer; 2016. 5. p. 51-63p. Edit
On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
On the average number of states of partial derivative automata. In: Developments in language theory. Vol 6224. Springer, Berlin; 2010. 1. p. 112-123p. (Lecture Notes in Comput. Sci.; vol 6224).Edit
Partial Derivative Automaton for Regular Expressions with Shuffle. In: Shallit J, Okhotin A, editors. Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15). Springer; 2015. 2. p. 21-32p. Edit
On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.Edit

Error | CMUP

# Error

The website encountered an unexpected error. Please try again later.