762 search results - page 34 / 153 » Intercode Regular Languages |
123
click to vote
MFCS
2010
Springer
15 years 22 days ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
121
click to vote
ICTAC
2007
Springer
15 years 8 months ago
2007
Springer
We present regular linear temporal logic (RLTL), a logic that generalizes linear temporal logic with the ability to use regular expressions arbitrarily as sub-expressions. Every LT...
104
click to vote
INFORMATICALT
2002
15 years 2 months ago
2002
In this paper we consider non-deterministic finite Rabin
CIE
2005
Springer
15 years 7 months ago
2005
Springer
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...
100
click to vote
CSL
2004
Springer
15 years 7 months ago
2004
Springer
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...