ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 648 of 1,394,228
|
|
Results 1 - 20 of 648
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
Bounded delay L codes
|
|
July 1991
|
|
Theoretical Computer Science
, Volume 84 Issue 2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
|
|
|
2
|
|
Controlling the behavior of functional language systems
|
|
October 1987
|
|
Proc. of a conference on Functional programming languages and computer architecture
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
3
|
|
4
|
|
From regulated rewriting to computing with membranes: collapsing hierarchies
|
|
January 2004
|
|
Theoretical Computer Science
, Volume 312 Issue 2-3
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 5 |
|
|
In addressing certain problems about membrane computing, a recent and active branch of natural computing, it first was necessary to address certain problems from the area of regulated rewriting. Thus, the present paper is a contribution to both these ...
Keywords: P system, graph-controlled grammar, matrix grammar, membrane computing, non-terminal complexity, programmed grammar, recursively enumerable language, register machine, regulated rewriting
|
|
5
|
|
6
|
|
7
|
|
A Parallel Algorithm for Binary-Tree-Based String Re-writing in the L-System
|
|
August 2007
|
|
IMSCCS '07: Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The L-system is a commonly used methodology to generate fractals and realistic model plants, yet it is very complex and computationally expensive. This paper presents a new parallel L-system string re-writing algorithm based on two types of binary tree: ...
|
|
8
|
|
9
|
|
10
|
|
A note on the strong and weak generative powers of formal systems
|
|
February 2003
|
|
Theoretical Computer Science
, Volume 293 Issue 2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
This paper is a note on some relationships between the strong and weak generative powers of formal systems, in particular, from the point of view of squeezing more strong power out of a formal system without increasing its weak generative power. We will ...
Keywords: Lambek grammars, crossing dependencies, lexicalized tree-adjoining grammars, multi-component grammars, strong generative capacity, tree insertion grammars
|
|
11
|
|
Combinatorial hypermap rewriting
|
|
May 1987
|
|
on Rewriting techniques and applications
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
12
|
|
Logicality of conditional rewrite systems
|
|
April 2000
|
|
Theoretical Computer Science
, Volume 236 Issue 1-2
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
|
Keywords: conditional equational logic, conditional rewrite systems, logicality
|
|
13
|
|
Unification problem with one-sided distributivity
|
|
February 1987
|
|
Journal of Symbolic Computation
, Volume 3 Issue 1-2
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
|
|
14
|
|
Simplification of algebraic expression by multiterm rewriting rules
|
|
October 1986
|
|
SYMSAC '86: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(433.55 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 5, Downloads (12 Months): 45, Downloads (Overall): 241, Citation Count: 0 |
|
|
In simplifying an algebraic expression, human often applies multiterm rewriting rules cleverly. This paper describes a simple multiterm rewriting algorithm which simulates human simplification naively. The algorithm is simple but seems to be quite useful ...
|
|
15
|
|
16
|
|
REVEUR4: A laboratory for conditional rewriting
|
|
February 1987
|
|
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
17
|
|
TDProlog: an extended Prolog with term description
|
|
August 1986
|
|
Proceedings of the 4th conference on Logic programming '85
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
18
|
|
19
|
|
Undecidability results for uniformly k-limited 0L systems
|
|
February 2000
|
|
Journal of Automata, Languages and Combinatorics
, Volume 5 Issue 2
|
|
Publisher: Otto-von-Guericke-Universitat
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
Keywords: k-limited 0L systems, decision questions, formal languages, uniformly k-limited 0L systems
|
|
20
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site