Sciweavers

759 search results - page 19 / 152
» Overlap-Free Regular Languages
Sort
View
CIE
2005
Springer
14 years 2 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov
CSL
2004
Springer
14 years 1 months ago
Set Constraints on Regular Terms
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
Pawel Rychlikowski, Tomasz Truderung
PPDP
2010
Springer
13 years 6 months ago
Typed and unambiguous pattern matching on strings using regular expressions
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterizatio...
Claus Brabrand, Jakob G. Thomsen
JUCS
2002
73views more  JUCS 2002»
13 years 8 months ago
Some Remarks on Codes Defined by Petri Nets
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
Masami Ito, Jürgen Dassow, Ralf Stiebe
ICALP
2009
Springer
14 years 8 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange