Sciweavers

759 search results - page 141 / 152
» Overlap-Free Regular Languages
Sort
View
ICALP
1999
Springer
13 years 11 months ago
Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
Antonín Kucera, Richard Mayr
VL
1996
IEEE
130views Visual Languages» more  VL 1996»
13 years 11 months ago
Seeing Systolic Computations in a Video Game World
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...
Kenneth M. Kahn
APL
1992
ACM
13 years 11 months ago
Compiler Tools in APL
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
Robert Bernecky, Gert Osterburg
FINTAL
2006
13 years 11 months ago
Morphological Lexicon Extraction from Raw Text Data
The tool extract enables the automatic extraction of lemma-paradigm pairs from raw text data. The tool uses search patterns that consist of regular expressions and propositional lo...
Markus Forsberg, Harald Hammarström, Aarne Ra...
CISIS
2008
IEEE
13 years 9 months ago
Multi-variant Program Execution: Using Multi-core Systems to Defuse Buffer-Overflow Vulnerabilities
While memory-safe and type-safe languages have been available for many years, the vast majority of software is still implemented in type-unsafe languages such as C/C++. Despite ma...
Babak Salamat, Andreas Gal, Todd Jackson, Karthike...