University of Tasmania
Browse

Labelled Cayley graphs and minimal automata

Download (96.95 kB)
journal contribution
posted on 2023-05-25, 22:30 authored by Kelarev, A
Cayley graphs considered as language recognisers are as powerful as the more general finite state automata. This paper applies Cayley graphs to define a class of automata and describe minimal automata of this type, all their congruences and the Nerode equivalence of states.

History

Publication title

Australasian J. Combinatorics

Volume

30

Pagination

95-101

Publication status

  • Published

Repository Status

  • Open

Usage metrics

    University Of Tasmania

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC