Regular languages generated by reflexive finite splicing systems

DOI10.1007/3-540-45007-6_10MaRDI QIDQ4452057zbMATH OpenFDO

Authors Clelia De Felice, Giancarlo Mauri, Rosalba Zizza, Paola Bonizzoni

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100134.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The structure of reflexive regular splicing languages via Schützenberger constants
• Splicing systems: Regularity and below
• Deciding whether a regular language is generated by a splicing system
• Deciding whether a regular language is generated by a splicing system
• A characterization of regular circular languages generated by marked splicing systems

Cited in

(11)

• The structure of reflexive regular splicing languages via Schützenberger constants
• Existence of constants in regular splicing languages
• Language generating alphabetic flat splicing P systems
• Regular splicing languages and subclasses
• Linear splicing and syntactic monoid
• Extended Watson-Crick L Systems with Regular Trigger Languages
• Deciding whether a regular language is generated by a splicing system
• Circular splicing and regularity
• Deciding whether a regular language is generated by a splicing system
• Constants and label-equivalence: a decision procedure for reflexive regular splicing languages
• Recognizing splicing languages: syntactic monoids and simultaneous pumping

This page was built for publication: Regular languages generated by reflexive finite splicing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452057)