644 search results - page 63 / 129 » Precedence Automata and Languages |
138
click to vote
GCC
2003
Springer
15 years 10 months ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
116
click to vote
TACS
2001
Springer
15 years 9 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
168
click to vote
ACL
1996
15 years 6 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
149
click to vote
TCS
2010
14 years 11 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
141
click to vote
RTAS
2003
IEEE
15 years 10 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...