1052 search results - page 117 / 211 » The Regular Real-Time Languages |
161
click to vote
MEMOCODE
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...
152
click to vote
MCMASTER
1993
15 years 8 months ago
1993
With the recent advances in massively parallel programmable processor networks, methods for the infusion of massive MIMD parallelism into programs have become increasingly relevant...
132
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
128
click to vote
IPL
2006
15 years 3 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
142
click to vote
JIIS
2008
15 years 3 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...