644 search results - page 70 / 129 » Precedence Automata and Languages |
126
click to vote
FLAIRS
2004
15 years 6 months ago
2004
It is a vital and challenging issue in AI community to get the "Right Information" to the "Right People" in the "Right Language" in the "Right T...
132
click to vote
FBT
1998
15 years 6 months ago
1998
We build on work in designing modeling languages for hybrid systems in the development of CTA, the Cottbus Timed Automata. Our design features a facility to specify a hybrid system...
225
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
135
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
132
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...