762 search results - page 63 / 153 » Intercode Regular Languages |
145
click to vote
SBIA
2000
Springer
15 years 7 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...
158
click to vote
STACS
1991
Springer
15 years 7 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...
131
click to vote
FOSSACS
2000
Springer
15 years 7 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
136
click to vote
PFE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Product family architectures need to be captured much like “regular” software architectures. Unfortunately, representations for product family architectures are scarc...
151
click to vote
ACL
1992
15 years 5 months ago
1992
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...