759 search results - page 37 / 152 » Overlap-Free Regular Languages |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
AUTOMATICA
2004
13 years 8 months ago
2004
This paper formulates an unconstrained optimal policy for control of regular languages realized as deterministic
LATA
2009
Springer
14 years 3 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
ISAMI
2010
13 years 6 months ago
2010
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
FMSD
2007
13 years 8 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...