Nikola Ruskuc

Orcid: 0000-0003-2415-9334

According to our database1, Nikola Ruskuc authored at least 37 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the number of countable subdirect powers of unary algebras.
Int. J. Algebra Comput., September, 2023

Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings.
CoRR, 2023

2021
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations.
SIAM J. Discret. Math., 2021

2020
Right noetherian semigroups.
Int. J. Algebra Comput., 2020

Bounded homomorphisms and finitely generated fiber products of lattices.
Int. J. Algebra Comput., 2020

2019
Generating subdirect products.
J. Lond. Math. Soc., 2019

Rationality for subclasses of 321-avoiding permutations.
Eur. J. Comb., 2019

2017
On well quasi-order of graph classes under homomorphic image orderings.
Eur. J. Comb., 2017

2016
On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups.
Theor. Comput. Sci., 2016

On the star-height of factor counting languages and their relationship to Rees zero-matrix semigroups.
CoRR, 2016

2015
Homomorphic Image Orders on Combinatorial Structures.
Order, 2015

Well quasi-order in combinatorics: embeddings and homomorphisms.
Proceedings of the Surveys in Combinatorics 2015, 2015

2013
Every Group is a Maximal Subgroup of the Free Idempotent Generated Semigroup over a band.
Int. J. Algebra Comput., 2013

2012
Unary FA-Presentable Semigroups.
Int. J. Algebra Comput., 2012

Subalgebras of FA-presentable algebras
CoRR, 2012

Deciding Word Problems of Semigroups using Finite State Automata
CoRR, 2012

2011
Substitution-closed pattern classes.
J. Comb. Theory A, 2011

On convex permutations.
Discret. Math., 2011

2010
Automatic Presentations and Semigroup Constructions.
Theory Comput. Syst., 2010

Growth Rates for Subclasses of Av(321).
Electron. J. Comb., 2010

2009
Automatic presentations for semigroups.
Inf. Comput., 2009

2008
Simple permutations: Decidability and unavoidable substructures.
Theor. Comput. Sci., 2008

Pattern classes of permutations via bijections between linearly ordered sets.
Eur. J. Comb., 2008

Automatic Presentations for Cancellative Semigroups.
Proceedings of the Language and Automata Theory and Applications, 2008

2005
Finite Presentability of HNN Extensions of Inverse Semigroups.
Int. J. Algebra Comput., 2005

Subsemigroups of the Bicyclic Monoid.
Int. J. Algebra Comput., 2005

Pattern Avoidance Classes and Subpermutations.
Electron. J. Comb., 2005

The Insertion Encoding of Permutations.
Electron. J. Comb., 2005

2003
Regular closed sets of permutations.
Theor. Comput. Sci., 2003

2002
Sorting with two ordered stacks in series.
Theor. Comput. Sci., 2002

Partially Well-Ordered Closed Sets of Permutations.
Order, 2002

Computing Transformation Semigroups.
J. Symb. Comput., 2002

Automatic Semigroups with Subsemigroups of Finite Rees Index.
Int. J. Algebra Comput., 2002

2001
Automatic semigroups.
Theor. Comput. Sci., 2001

Confluent Monadic String-Rewriting Systems and Automatic Structures.
J. Autom. Lang. Comb., 2001

1996
On Subsemigroups and ideals in Free Products of Semigroups.
Int. J. Algebra Comput., 1996

1995
Rewriting a Semigroup Presentation.
Int. J. Algebra Comput., 1995


  Loading...