759 search results - page 141 / 152 » Overlap-Free Regular Languages |
85
Voted
ICALP
1999
Springer
15 years 6 months ago
1999
Springer
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...
126
click to vote
VL
1996
IEEE
15 years 6 months ago
1996
IEEE
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...
101
click to vote
APL
1992
ACM
15 years 6 months ago
1992
ACM
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...
110
click to vote
FINTAL
2006
15 years 5 months ago
2006
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...
109
click to vote
CISIS
2008
IEEE
15 years 3 months ago
2008
IEEE
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...