Repository logo
 
Publication

Groups synchronizing a transformation of non-uniform kernel

dc.contributor.authorAraújo, João
dc.contributor.authorBentz, Wolfram
dc.contributor.authorCameron, Peter J.
dc.date.accessioned2015-03-23T14:21:14Z
dc.date.available2015-03-23T14:21:14Z
dc.date.issued2013
dc.description.abstractSuppose that a deterministic finite automata A = (Q ,Σ) is such that all but one letters from the alphabet Σ act as permutations of the state set Q and the exceptional letter acts as a transformation with non-uniform kernel. Which properties of the permutation group G generated by the letters acting as permutations ensure that A becomes a synchronizing automaton under every possible choice of the exceptional letter (provided the exceptional letter acts as a transformation of non-uniform kernel)? Such permutation groups are called almost synchronizing. It is easy to see that an almost synchronizing group must be primitive; our conjecture is that every primitive group is almost synchronizing. Clearly every synchronizing group is almost synchronizing. In this paper we provide two different methods to find non-synchronizing, but almost synchronizing groups. The infinite families of examples provided by the two different methods have few overlaps. The paper closes with a number of open problems on group theory and combinatorics.por
dc.identifier.citationAraújo, João; Bentz, Wolfram; Cameron, Peter - Groups synchronizing a transformation of non-uniform kernel. "Theoretical Computer Science" [Em linha]. ISSN 0304-3975. Vol. 498 (2013), p. 1-15por
dc.identifier.doidoi:10.1016/j.tcs.2013.06.016
dc.identifier.issn0304-3975
dc.identifier.urihttp://hdl.handle.net/10400.2/3794
dc.language.isoengpor
dc.peerreviewedyespor
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0304397513004829por
dc.subjectAlgebraic theory of languages and automatapor
dc.subjectComplexity classespor
dc.subjectComputational methodspor
dc.subjectFinite automorphism groups of algebraicpor
dc.subjectGeometric, or combinatorial structurespor
dc.subjectPrimitive groupspor
dc.subjectPseudo-corespor
dc.subjectSemigroups in automata theorypor
dc.subjectSemigroups of transformationspor
dc.subjectShronizing automatapor
dc.titleGroups synchronizing a transformation of non-uniform kernelpor
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage15por
oaire.citation.startPage1por
oaire.citation.titleTheoretical Computer Sciencepor
person.familyNameRibeiro Soares Gonçalves de Araújo
person.familyNameBentz
person.givenNameJoão Jorge
person.givenNameWolfram
person.identifier.ciencia-idEC1F-273A-9F24
person.identifier.ciencia-idBE11-F004-1168
person.identifier.orcid0000-0001-6655-2172
person.identifier.orcid0000-0003-0002-1277
rcaap.rightsopenAccesspor
rcaap.typearticlepor
relation.isAuthorOfPublication1f7b349c-3251-480d-a3ac-e3cb4ef44f22
relation.isAuthorOfPublication20420639-0e78-4226-a2e3-892cd2eaa7e8
relation.isAuthorOfPublication.latestForDiscovery1f7b349c-3251-480d-a3ac-e3cb4ef44f22

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2013Groups.pdf
Size:
353.06 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.97 KB
Format:
Item-specific license agreed upon to submission
Description: