• Refine your search:
  • 
    Keyword:
    
    • Decidability (1)
    • FOS Computer and information sciences (1)
    • Finite Automata (1)
    • Formal Languages and Automata Theory cs.FL (1)
    • Language Operations (1)
    • Shuffle on Trajectories (1)
    • State Complexity (1)
  • 
    Creator / Publisher:
    
    • Cho, Da-Jung (2)
    • Han, Yo-Sub (2)
    • Salomaa, Kai (2)
    • Smith, Taylor J. (2)
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 2 of 2 1 Site-directed insertion: Language equations and decision problems Cho, Da-Jung; Han, Yo-Sub; Salomaa, Kai; Smith, Taylor J.. - : Elsevier, 2019 Abstract: The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.tcs.2019.04.019 ©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ ; Site-directed insertion is an overlapping insertion operation that can be viewed as analogous to the overlap assembly or chop operations that concatenate strings by overlapping a suffix and a prefix of the argument strings. We consider decision problems and language equations involving site-directed insertion. By relying on the tools provided by semantic shuffle on trajectories (M. Domaratzki, Developments in Language Theory 2004) we show that one variable equations involving site-directed insertion and regular constants can be solved algorithmically. We consider also maximal and minimal variants of the site-directed insertion operation and the nondeterministic state complexity of site-directed insertion. ; Labex DigiCosme: ANR-11-LABEX-0045-DIGICOSME ; ANRANR: ANR-11-IDEX-0003-02 ; CNRSCNRS ; NRFNRF: 2018R1D1A1A09084107 ; Natural Sciences and Engineering Research Council of CanadaNatural Sciences and Engineering Research Council of Canada: OGP0147224 Keyword: Decidability; Finite Automata; Language Operations; Shuffle on Trajectories; State Complexity URL: https://doi.org/10.1016/j.tcs.2019.04.019 http://hdl.handle.net/1974/26294 BASE Hide details 2 Site-Directed Insertion: Decision Problems, Maximality and Minimality ... Cho, Da-Jung; Han, Yo-Sub; Salomaa, Kai. - : arXiv, 2018 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 2 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0