644 search results - page 61 / 129 » Precedence Automata and Languages |
147
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
118
click to vote
IANDC
2006
15 years 4 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
126
click to vote
CICLING
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Documents written in languages other than English sometimes include parenthetical English translations, usually for technical and scienti c terminology. Techniques had be...
133
click to vote
AAAI
1992
15 years 5 months ago
1992
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
115
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...