Algebraic Informatics. 9th International Conference, CAI 2022 Virtual Event, October 27–29, 2022 Proceedings

233 Pages·2022·4.135 MB·English

by  Dimitrios Poulakis, George Rahonis

Dimitrios Poulakis
George Rahonis (Eds.)
6
0
7
3
1

S
C Algebraic Informatics
N
L
9th International Conference, CAI 2022
Virtual Event, October 27–29, 2022
Proceedings
Lecture Notes in Computer Science 13706
FoundingEditors
GerhardGoos
KarlsruheInstituteofTechnology,Karlsruhe,Germany
JurisHartmanis
CornellUniversity,Ithaca,NY,USA
EditorialBoardMembers
ElisaBertino
PurdueUniversity,WestLafayette,IN,USA
WenGao
PekingUniversity,Beijing,China
BernhardSteffen
TUDortmundUniversity,Dortmund,Germany
MotiYung
ColumbiaUniversity,NewYork,NY,USA
Moreinformationaboutthisseriesathttps://link.springer.com/bookseries/558
·
Dimitrios Poulakis George Rahonis (Eds.)
Algebraic Informatics
9th International Conference, CAI 2022
Virtual Event, October 27–29, 2022
Proceedings
Editors
DimitriosPoulakis GeorgeRahonis
AristotleUniversityofThessaloniki AristotleUniversityofThessaloniki
Thessaloniki,Greece Thessaloniki,Greece
ISSN 0302-9743 ISSN 1611-3349 (electronic)
LectureNotesinComputerScience
ISBN 978-3-031-19684-3 ISBN 978-3-031-19685-0 (eBook)
https://doi.org/10.1007/978-3-031-19685-0
©TheEditor(s)(ifapplicable)andTheAuthor(s),underexclusivelicense
toSpringerNatureSwitzerlandAG2022
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow
knownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Thepublisher,theauthors,andtheeditorsaresafetoassumethattheadviceandinformationinthisbookare
believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin
publishedmapsandinstitutionalaffiliations.
ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland
Preface
This volume contains the papers presented at the 9th International Conference on
AlgebraicInformatics(CAI2022).Theconferencewasorganizedundertheauspicesof
theDepartmentofMathematicsoftheAristotleUniversityofThessaloniki,Greece,and
tookplaceonlineduringOctober27–29,2022.
CAI is a biennial conference devoted to the intersection of theoretical computer
science,algebra,andrelatedareas.Itwasinitiatedin2005,bySymeonBozapalidis,in
Thessaloniki,Greece.CAI2007and2009werehostedagaininThessaloniki,CAI2011
in Linz, Austria, CAI 2013 in Porquerolles, France, CAI 2015 in Stuttgart, Germany,
CAI2017inKalamata,Greece,andCAI2019inNiš,Serbia.Theorganizationofthe
conferencein2021wasshiftedto2022duetotheCOVID-19pandemic.
The contents of the volume consist of two abstracts, three full papers of invited
speakers,and12contributedpapers.TheinvitedlecturesweregivenbyManfredDroste,
Yuri Matiyasevich, Panos Pardalos, Jean-Éric Pin, Robert Rolland, Paul Spirakis, and
Moshe Vardi. In total 17 papers were submitted to CAI 2022 and 12 of them were
carefullyselectedthroughasingle-blindpeer-reviewprocess.Allpapers(butone)were
reviewedbyatleastthreereviewers(respectivelytwo)andonaverage3.1.Thepapers
containoriginalandunpublishedresearch;thetopicsofthemlieinautomatatheory,cryp-
tography,codingtheory,DNAcomputation,computeralgebra,andtheoryofsoftware
architectures.
WearedeeplygratefultothemanypeoplewhosupportedCAI2022andhelpedto
organizeasuccessfulevent.Firstofall,wewouldliketothankthemembersoftheSteer-
ingCommitteewhoacceptedourproposalfortheorganizationofCAI2022.Wethank
the colleagues in the Program Committee and further reviewers for their cooperation
andexcellentworkinthereviewprocess.WethankPanagiotisTzounakisfortechnical
supportwiththewebsiteandtheonlinesystemforconference’simplementation.
The submission and the review process of the papers was done using the reliable
EasyChairplatformwhichmadeourjobeasier.
Last but not least, we are deeply grateful to Springer LNCS. Especially, to Ronan
Nugent,AnnaKramerandChristineReisswhohelpedus,topublishtheproceedingsof
CAI2022inLNCS.
The financial support of the Special Account for Research Funds of the Aristotle
UniversityofThessalonikiisacknowledged.
September2022 DimitriosPoulakis
GeorgeRahonis
Organization
CAI2022wasorganizedundertheauspicesoftheDepartmentofMathematicsofthe
AristotleUniversityofThessaloniki,Greece.
ProgramCommitteeChairs
DimitriosPoulakis AristotleUniversityofThessaloniki,Greece
GeorgeRahonis AristotleUniversityofThessaloniki,Greece
SteeringCommittee
SymeonBozapalidis AristotleUniversityofThessaloniki,Greece
OlivierCarton UniversitédeParis,France
ManfredDroste UniversityofLeipzig,Germany
WernerKuich TUWien,Austria
DimitriosPoulakis AristotleUniversityofThessaloniki,Greece
ArtoSalomaa UniversityofTurku,Finland
ProgramCommittee
IoannisAntoniou AristotleUniversityofThessaloniki,Greece
YvesAubry UniversitédeToulonandAix-Marseille
Université,France
SimonBliudze InriaLille,France
MiroslavC´iric´ UniversityofNiš,Serbia
KonstantinosDraziotis AristotleUniversityofThessaloniki,Greece
FrankDrewes UmeåUniversity,Sweden
HenningFernau UniversitätTrier,Germany
ZoltánFülöp UniversityofSzeged,Hungary
IstvánGaál UniversityofDebrecen,Hungary
DoraGiammaresi UniversitàdegliStudidiRoma“TorVergata”,
Italy
MikaHirvensalo UniversityofTurku,Finland
JarkkoKari UniversityofTurku,Finland
LilaKari UniversityofWaterloo,Canada
PanagiotisKatsaros AristotleUniversityofThessaloniki,Greece
StavrosKonstantinidis SaintMary’sUniversity,Canada
TemurKutsia JohannesKeplerUniversitätLinz,Austria
viii Organization
AndreasMaletti UniversitätLeipzig,Germany
AnastasiaMavridou NASAAmesResearchCenter,USA
SihemMesnager UniversityofParisVIIIandTelecomParis,France
BenjaminMonmege Aix-MarseilleUniversité,France
AbderahmaneNitaj UniversityofCaenNormandy,France
KaiSalomaa Queen’sUniversity,Canada
WolfgangSchreiner JohannesKeplerUniversitätLinz,Austria
PascalVéron UniversitédeToulon,France
HeikoVogler TUDresden,Germany
MikhailVolkov UralFederalUniversity,Russia
MichaelVrahatis UniversityofPatras,Greece.
AdditionalReviewers
EduardBaranov CharlesOlivier-Anclin
MarkusBläser KostantinosParsopoulos
AlexisBonnecaze
EricPaul
GustavGrabolle
RobertRolland
KalpanaMahalingam
YannisStamatiou
MirceaMartin
GerasimosMeletiou CharlotteVermeylen
AndyOertel MartinWinter
OrganizingCommittee
DimitriosPoulakis
GeorgeRahonis
PanagiotisTzounakis
SponsoringInstitution
SpecialAccountforResearchFundsoftheAristotleUniversityofThessaloniki
Abstracts of Invited Talks
Weighted Automata Over Monotonic Strong Bimonoids:
Decidability and Undecidability of Finite Image
ManfredDroste
InstituteofComputerScience,LeipzigUniversity,Leipzig,Germany
[email protected]
AweightedfiniteautomatonAhasfiniteimageiftheimageoftheweightedlanguage
associatedwithitisfinite.First,wegiveastructuralresultcharacterizingwhenAhas
finiteimage.Thenwecharacterizethosepast-finitemonotonicstrongbimonoidssuch
thatforeachweightedfiniteautomatonAitisdecidablewhetherAhasfiniteimage.In
particular,thisisdecidableoverpast-finitemonotonicsemirings.
Next, we give two undecidability results on the finite-image property of weighted
finite automata over semirings, respectively strong bimonoids. We construct a com-
putableidempotentcommutativepast-finiteorderedsemiringsuchthatitisundecidable,
foranarbitrarydeterministicweightedfiniteautomatonAoverthatsemiring,whether
Ahasfiniteimage.Finally,weconstructacomputablecommutativepast-finitemono-
tonicorderedstrongbimonoidsuchthatitisundecidable,foranarbitraryweightedfinite
automatonAoverthatstrongbimonoid,whetherAhasfiniteimage.Thisshowsthatthe
decidabilityresultsmentionedbeforecannotbeextendedtonaturalclassesofordered
semiringsandorderedstrongbimonoidswithoutfurtherassumptions.
References
1.Droste,M.,Fülöp,Z.,Kószó,D.,Vogler,H.:Finite-imagepropertyofweightedtree
automataoverpast-finitemonotonicstrongbimonoids.Theor.Comput.Sci.919,118–
143(2022).https://doi.org/10.1016/j.tcs.2022.03.036
2.Droste,M.,Fülöp,Z.,Kószó,D.,Vogler,H.:Decidabilityboundariesforthefinite-
imagepropertyofweightedfiniteautomata.Int.J.Found.Comput.Sci.,toappear