40 search results - page 4 / 8 » Regularity and Context-Freeness over Word Rewriting Systems |
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
ENTCS
2007
14 years 11 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
112
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
106
Voted
CSJM
2008
14 years 11 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
80
Voted
MST
2007
14 years 11 months ago
2007
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...