644 search results - page 84 / 129 » Precedence Automata and Languages |
83
Voted
TAPSOFT
1991
Springer
15 years 3 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
105
click to vote
ECOWS
2008
Springer
15 years 1 months ago
2008
Springer
In order to specify the composition of Web services, WSBPEL was defined as an orchestrating language by an international standards consortium. In this paper, we propose a method t...
COLING
2000
15 years 1 months ago
2000
In this paper we present an integrated system for tagging and chunking texts from a certain language. The approach is based on stochastic finite-state models that are learnt autom...
87
Voted
LATA
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
89
Voted
CORR
2000
Springer
14 years 11 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...