Skip to content

Research at St Andrews

Deciding Word Problems of Semigroups using Finite State Automata

Research output: Contribution to journalArticle

Details

Original languageEnglish
JournalTheoretical Computer Science
Publication statusIn preparation - 2011

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Rationality for subclasses of 321-avoiding permutations

    Albert, M. H., Brignall, R., Ruskuc, N. & Vatter, V., 6 Feb 2019, In : European Journal of Combinatorics. 78, p. 44-72

    Research output: Contribution to journalArticle

  2. Generating subdirect products

    Mayr, P. & Ruskuc, N., 9 Apr 2019, In : Journal of the London Mathematical Society. Early View

    Research output: Contribution to journalArticle

  3. On the number of subsemigroups of direct products involving the free monogenic semigroup

    Clayton, A. & Ruskuc, N., 1 Feb 2019, In : Journal of the Australian Mathematical Society. First View, 12 p.

    Research output: Contribution to journalArticle

  4. An introduction to presentations of monoid acts: quotients and subacts

    Miller, C. & Ruskuc, N., 27 Jan 2019, In : Communications in Algebra. Latest Articles

    Research output: Contribution to journalArticle

  5. Solvable quotients of subdirect products of perfect groups are nilpotent

    Kearnes, K., Mayr, P. & Ruskuc, N., Dec 2018, In : Bulletin of the London Mathematical Society. 50, 6, p. 1016-1026 11 p.

    Research output: Contribution to journalArticle

Related by journal

  1. On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups

    Bourne, T. & Ruškuc, N., 15 Nov 2016, In : Theoretical Computer Science. 653, p. 87-96

    Research output: Contribution to journalArticle

  2. Groups synchronizing a transformation of non-uniform kernel

    Cameron, P. J., Araujo, J. & Bentz, W., 2013, In : Theoretical Computer Science. 498, p. 1-9

    Research output: Contribution to journalArticle

  3. Finite complete rewriting systems for regular semigroups

    Gray, R. & Malheiro, A., 4 Mar 2011, In : Theoretical Computer Science. 412, 8-10, p. 654-661 8 p.

    Research output: Contribution to journalArticle

  4. Computation of distances for regular and context-free probabilistic languages

    Nederhof, M. J. & Satta, G., 1 May 2008, In : Theoretical Computer Science. 395, 2-3, p. 235-254 20 p.

    Research output: Contribution to journalArticle

ID: 13162275