762 search results - page 99 / 153 » Intercode Regular Languages |
129
click to vote
LACL
1998
Springer
15 years 6 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...
121
Voted
AAIM
2008
Springer
15 years 4 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...
113
click to vote
FM
2008
Springer
15 years 3 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...
125
click to vote
EACL
2006
ACL Anthology
15 years 3 months ago
2006
ACL Anthology
Morphologically complex terms composed from Greek or Latin elements are frequent in scientific and technical texts. Word forming units are thus relevant cues for the identificatio...
128
click to vote
DLT
2003
15 years 3 months ago
2003
We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semi...