759 search results - page 124 / 152 » Odometers on Regular Languages |
ICLP
2005
Springer
14 years 27 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ICGI
2004
Springer
14 years 23 days ago
2004
Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
PODS
2010
ACM
14 years 14 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
JAVA
2001
Springer
13 years 12 months ago
2001
Springer
We present efficient support for generalized arrays of parallel data driven objects. Array elements are regular C++ objects, and are scattered across the parallel machine. An indi...