Sciweavers

493 search results - page 56 / 99
» Alternating Weighted Automata
Sort
View
ESOP
2009
Springer
14 years 18 days ago
Verified, Executable Parsing
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...
Aditi Barthwal, Michael Norrish
FOSSACS
2006
Springer
14 years 12 days ago
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
Cosimo Laneve, Luca Padovani
COLING
1996
13 years 10 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
ICGI
2010
Springer
13 years 9 months ago
Enhanced Suffix Arrays as Language Models: Virtual k-Testable Languages
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
Herman Stehouwer, Menno van Zaanen
ENTCS
2006
120views more  ENTCS 2006»
13 years 8 months ago
Temporal Assertions using AspectJ
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
Volker Stolz, Eric Bodden