Sciweavers

84 search results - page 2 / 17
» Efficient Enumeration of Regular Languages
Sort
View
LATA
2011
Springer
12 years 10 months ago
Networks of Evolutionary Processors with Subregular Filters
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
Jürgen Dassow, Florin Manea, Bianca Truthe
MST
2007
132views more  MST 2007»
13 years 6 months ago
Odometers on Regular Languages
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...
Valérie Berthé, Michel Rigo
SOFSEM
2000
Springer
13 years 11 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 7 months ago
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Abstract. The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability)...
Christian Glasser, Heinz Schmitz, Victor L. Seliva...
APIN
2000
103views more  APIN 2000»
13 years 7 months ago
Probabilistic Pattern Matching and the Evolution of Stochastic Regular Expressions
The use of genetic programming for probabilistic pattern matching is investigated. A stochastic regular expression language is used. The language features a statistically sound sem...
Brian J. Ross