The structure of reflexive regular splicing languages via Schützenberger constants
From MaRDI portal
Publication:1779297
DOI10.1016/j.tcs.2004.12.033zbMath1080.68049OpenAlexW2068938356WikidataQ62039452 ScholiaQ62039452MaRDI QIDQ1779297
Rosalba Zizza, Paola Bonizzoni, Clelia De Felice
Publication date: 1 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.033
Related Items (11)
Constants and label-equivalence: a decision procedure for reflexive regular splicing languages ⋮ Deciding whether a regular language is generated by a splicing system ⋮ Representation of (Left) Ideal Regular Languages by Synchronizing Automata ⋮ Circular splicing and regularity ⋮ Recognizing splicing languages: syntactic monoids and simultaneous pumping ⋮ Conjugate word blending: formal model and experimental implementation by XPCR ⋮ Hybrid and generalized marked systems ⋮ Regular splicing languages and subclasses ⋮ Linear splicing and syntactic monoid ⋮ A characterization of regular circular languages generated by marked splicing systems ⋮ Existence of constants in regular splicing languages
Cites Work
- Recognizing splicing languages: syntactic monoids and simultaneous pumping
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Splicing semigroups of dominoes and DNA
- Separating some splicing models.
- On the splicing operation
- Regularity of splicing languages
- Regular splicing languages and subclasses
- Linear splicing and syntactic monoid
- Computational Modeling for Genetic Splicing Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The structure of reflexive regular splicing languages via Schützenberger constants
