762 search results - page 75 / 153 » Intercode Regular Languages |
155
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...
134
click to vote
CSR
2008
Springer
15 years 6 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...
129
click to vote
IPL
2006
15 years 4 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...
145
Voted
JIIS
2008
15 years 4 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...
117
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...