759 search results - page 83 / 152 » Overlap-Free Regular Languages |
NC
2008
14 years 9 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
ACL
2007
14 years 11 months ago
2007
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
SIGCSE
1997
ACM
15 years 2 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
SBIA
2000
Springer
15 years 1 months ago
2000
Springer
In recent years, the Natural Language Processing scene has witnessed the steady growth of interest in connectionist modeling. The main appeal of such an approach is that one does n...
102
click to vote
STACS
1991
Springer
15 years 1 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...