759 search results - page 16 / 152 » Overlap-Free Regular Languages |
SOFSEM
2012
Springer
12 years 4 months ago
2012
Springer
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
FSTTCS
2001
Springer
14 years 29 days ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
BIRTHDAY
2004
Springer
14 years 1 months ago
2004
Springer
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
LATA
2009
Springer
14 years 3 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
FOSSACS
2011
Springer
12 years 12 months ago
2011
Springer
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...