759 search results - page 62 / 152 » Odometers on Regular Languages |
PFE
2001
Springer
15 years 2 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...
104
click to vote
ACL
1992
14 years 11 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...
105
click to vote
AOSD
2011
ACM
14 years 5 months ago
2011
ACM
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
DLT
2006
14 years 11 months ago
2006
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
115
click to vote
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...