759 search results - page 23 / 152 » Odometers on Regular Languages |
TIME
2002
IEEE
14 years 2 months ago
2002
IEEE
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite autom...
JUCS
2002
13 years 9 months ago
2002
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
CAISE
2008
Springer
2008
Springer
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
13 years 11 months ago
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
ICDT
2003
ACM
14 years 3 months ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...