Algorithms for determining relative star height and star height
Information and Computation
Handbook of theoretical computer science (vol. B)
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Splicing in abstract families of languages
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
Marked systems and circular splicing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Hi-index | 0.04 |
Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. Via automata properties we show that it is decidable whether a regular language L on a one-letter alphabet is generated by a finite (Paun) circular splicing system: L has this property if and only if there is a unique final state q"n on the closed path in the transition diagram of the minimal finite state automaton A recognizing L and q"n is idempotent (i.e., @d(q"n,a^n)=q"n). This result is obtained by an already known characterization of the unary languages L generated by a finite (Paun) circular splicing system and, in turn, allows us to simplify the description of the structure of L. This description is here extended to the larger class of the uniform languages, i.e., the circularizations of languages with the form A^J=@?"j"@?"JA^j, J being a subset of the set N of the nonnegative integers. Finally, we exhibit a regular circular language, namely ^~((A^2)^*@?(A^3)^*), that cannot be generated by any finite circular splicing system. nite circular splicing system.