6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers (Lecture Notes in Computer Science)
Edición de la obra Implementation and Application of Automata
| Autor | Bruce W. Watson |
|---|---|
| Editorial | Springer |
| Fecha de publicación | March 10, 2003 |
| Idioma | inglés |
| Páginas | 289 |
| Formato | Paperback |
| ISBN-13 | 9783540004004 |
| ISBN-10 | 3540004009 |
| OCLC | 155849719 |
| LCCN | 2003041533 |
| Número de Cutter |
W337i |
TheSixthInternationalConferenceonImplementationandApplicationof- tomata(CIAA2001)—the?rstoneheldinthesouthernhemisphere—was heldattheUniversityofPretoriainPretoria,SouthAfrica,on23–25July2001. ThisvolumeofSpringer’sLectureNotesinComputerSciencecontainsall thepapers(includingtheinvitedtalkbyGregorv. Bochmann)thatwerep- sentedatCIAA2001,aswellasanexpandedversionofoneoftheposterpapers displayedduringtheconference. Theconferenceaddressedtheissuesinautomataapplicationandimplemen- tion. Thetopicsofthepaperspresentedinthisconferencerangedfromautomata applicationsinsoftwareengineering,naturallanguageandspeechrecognition, andimageprocessing,tonewrepresentationsandalgorithmsfore?cientimp- mentationofautomataandrelatedstructures. Automatatheoryisoneoftheoldestareasincomputerscience. Researchin automatatheoryhasbeenmotivatedbyitsapplicationssinceitsearlystagesof development.^ Inthe1960sand1970s,automataresearchwasmotivatedheavily byproblemsarisingfromcompilerconstruction,circuitdesign,stringmatching, etc. Inrecentyears,manynewapplicationsofautomatahavebeenfoundin variousareasofcomputerscienceaswellasinotherdisciplines. Examplesofthe newapplicationsincludestatechartsinobject-orientedmodeling,?nitetra- ducersinnaturallanguageprocessing,andnondeterministic?nite-statemodels incommunicationprotocols. Manyofthenewapplicationscannotsimplyutilize theexistingmodelsandalgorithmsinautomatatheorytosolvetheirproblems. Newmodels,ormodi?cationsoftheexistingmodels,areneededtosatisfytheir requirements. Also,thesizesofthetypicalproblemsinmanyofthenewapp- cationsareastronomicallylargerthanthoseusedinthetraditionalapplications. Newalgorithmsandnewrepresentationsofautomataarerequiredtoreducethe timeandspacerequirementsofthecomputation. TheCIAAconferenceseriesprovidesaforumforthenewproblemsand challenges.^ Intheseconferences,boththeoreticalandpracticalresultsrelatedto theapplicationandimplementationofautomatawerepresentedanddiscussed, andsoftwarepackagesandtoolkitsweredemonstrated. Theparticipantsofthe conferenceserieswerefrombothresearchinstitutionsandindustry. Wethankalloftheprogramcommitteemembersandrefereesfortheire?orts inrefereeingandselectingpapers. Thisvolumewaseditedwithmuchhelpfrom NanetteSaesandHannekeDriever,whiletheconferenceitselfwasrunsmoothly withthehelpofElmarieWillemse,NanetteSaes,andTheoKoopman. VI Foreword WealsowishtothanktheSouthAfricanNRF(forfundingairfares)andthe DepartmentofComputerScience,UniversityofPretoria,fortheir?nancialand logisticsupportoftheconference. WealsothanktheeditorsoftheLectureNotes inComputerScienceseriesandSpringer-Verlag,inparticularAnnaKramer,for theirhelpinpublishingthisvolume. October2002 BruceW.^ Watson DerickWood CIAA 2001 Program Committee BernardBoigelot Universit´edeLiege,Belgium Jean-MarcChamparnaud Universit´edeRouen,France MaximeCrochemore UniversityofMarne-la-Vall´ee,France OscarIbarra UniversityofCaliforniaatSantaBarbara,USA LauriKarttunen XeroxPaloAltoResearchCenter,USA NilsKlarlund AT&TLaboratories,USA DenisMaurel Universit´edeTours,France MehryarMohri AT&TLaboratories,USA Jean-EricPin Universit´eParis7,France KaiSalomaa Queen’sUniversity,Canada HelmutSeidl TrierUniversity,Germany BruceWatson(Chair) UniversityofPretoria,SouthAfrica EindhovenUniversity,TheNetherlands DerickWood(Co-chair) HongKongUniversityofScience andTechnology,China ShengYu UniversityofWesternOntario,Canada Table of Contents UsingFiniteStateTechnologyinNaturalLanguageProcessingofBasque. . . 1 I˜nakiAlegria,MaxuxAranzabe,NereaEzeiza,AitzolEzeiza, andRubenUrizar CascadeDecompositionsareBit-VectorAlgorithms. . . . . . . . . . . . . . . . . . . . . . . .^ 13 AnneBergeronandSylvieHamel SubmoduleConstructionandSupervisoryControl:AGeneralization. . . . . . . 27 Gregorv. Bochmann CountingtheSolutionsofPresburgerEquations withoutEnumeratingThem. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 BernardBoigelotandLouisLatour Brzozowski’sDerivativesExtendedtoMultiplicities. . . . . . . . . . . . . . . . . . . . . . . . 52 Jean-MarcChamparnaudandG´erardDuchamp FiniteAutomataforCompactRepresentation ofLanguageModelsinNLP. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 JanDaciukandGertjanvanNoord PastPushdownTimedAutomata. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 ZheDang,Tev?kBultan,OscarH. Ibarra,andRichardA. Kemmerer SchedulingHardSporadicTasksbyMeans ofFiniteAutomataandGeneratingFunctions. . . . . . . . . . . . . . . . . . . . . . . . . . . . .^ 87 Jean-PhilippeDubernardandDominiqueGeniet Bounded-GraphConstruction forNoncanonicalDiscriminating-ReverseParsers. . . . . . . . . . . . . . . . . . . . . . . . . . 101 JacquesFarr´eandJos´eFortesGalvez ´ Finite-StateTransducerCascadetoExtractProperNamesinTexts. . . . . . . 115 NathalieFriburgerandDenisMaurel IsthisFinite-StateTransducerSequentiable?. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 Tamas ´ Ga´al CompilationMethodsofMini