5707 search results - page 190 / 1142 » Symbolic Simulation - Techniques and Applications |
176
click to vote
BIRTHDAY
1992
Springer
15 years 10 months ago
1992
Springer
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one production rule whose right hand side contains nonterminal symbols. Various prope...
141
Voted
DIAGRAMS
2008
Springer
15 years 8 months ago
2008
Springer
Diagrammatic logics have advantages over symbolic cousins. Peirce thought that logical diagrams (Existential Graphs, EG) are capable of "expression of all assertions", as...
168
click to vote
HIS
2008
15 years 8 months ago
2008
Most symbolic classifiers aim at building sets of rules with good coverage and precision. While this is suitable for most applications, they tend to neglect other desirable proper...
183
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete sourc...
184
click to vote
IJSI
2008
15 years 6 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...