759 search results - page 99 / 152 » Odometers on Regular Languages |
PLILP
1997
Springer
15 years 2 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
LATIN
1992
Springer
15 years 1 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
LACL
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
AAIM
2008
Springer
14 years 11 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
FM
2008
Springer
14 years 11 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...