759 search results - page 66 / 152 » Overlap-Free Regular Languages |
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
PADL
2004
Springer
15 years 3 months ago
2004
Springer
We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. ...
TAL
2004
Springer
15 years 3 months ago
2004
Springer
This work is about derivational suffixes, endings and prefixes of the Spanish language, which are useful for the establishment of about 70000 suffixal and 11000 prefixal extended m...
BIRTHDAY
2003
Springer
15 years 3 months ago
2003
Springer
In this paper we present the concepts of drawn symbolic picture and symbolic picture. Such notions have been conceived as an extension of the concept of drawn pictures which was i...