Green’s relations in deterministic finite automata

Green’s relations are a fundamental tool in the structure theory of semigroups. They can be defined by reachability in the (right/left/twosided) Cayley graph. The equivalence classes of Green’s relations then correspond to the strongly connected components. We study the complexity of Green’s relatio...

Full description

Bibliographic Details

Main Authors:	Lukas Fleischer, Manfred Kufleitner
Format:	Default Article
Published:	2018
Subjects:	Distributed computing and systems software not elsewhere classified Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified Distributed Computing
Online Access:	https://hdl.handle.net/2134/31946
Tags:	Add Tag No Tags, Be the first to tag this record!