644 search results - page 89 / 129 » Precedence Automata and Languages |
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
107
click to vote
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
APSEC
1999
IEEE
15 years 4 months ago
1999
IEEE
The management of complexity in large systems is traditionally focused on the modeling and management of classes and hierarchies of classes. In order to improve the compositional ...
102
click to vote
ACL
2012
13 years 2 months ago
2012
Long distance word reordering is a major challenge in statistical machine translation research. Previous work has shown using source syntactic trees is an effective way to tackle ...
ESOP
2009
Springer
15 years 3 months ago
2009
Springer
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...