18 search results - page 2 / 4 » A Proof of Regularity for Finite Splicing |
JACM
2002
13 years 5 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
EACL
2003
ACL Anthology
13 years 7 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
LACL
1998
Springer
13 years 9 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...
PLANX
2007
13 years 7 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
CSL
2009
Springer
13 years 9 months ago
2009
Springer
We study the confluence of Ehrhard and Regnier's differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence ...