759 search results - page 33 / 152 » Odometers on Regular Languages |
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
Speech recognition of inflectional and morphologically rich languages like Czech is currently quite a challenging task, because simple n-gram techniques are unable to capture impo...
MFCS
2010
Springer
14 years 8 months 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...
ICTAC
2007
Springer
15 years 4 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...
INFORMATICALT
2002
14 years 9 months ago
2002
In this paper we consider non-deterministic finite Rabin
CIE
2005
Springer
15 years 3 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...