759 search results - page 36 / 152 » Overlap-Free Regular Languages |
IANDC
2007
13 years 8 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
ICALP
2000
Springer
14 years 3 days ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
ADBIS
2000
Springer
14 years 4 days ago
2000
Springer
In this paper we describe an approach to representation of data and knowledge using two technologies: XML and regular expressions in a domain of natural language syntactic analysis...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
AUTOMATICA
2005
13 years 8 months ago
2005
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...