scientific article; zbMATH DE number 2040901

MaRDI QIDQ4452057zbMATH OpenFDO

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

Publication date 11 February 2004

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
• scientific article; zbMATH DE number 1953224
• 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)

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

This page was built for publication:

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