Sciweavers

224 search results - page 2 / 45
» Three New Algorithms for Regular Language Enumeration
Sort
View
AFL
2011
98views more  AFL 2011»
12 years 5 months ago
Accepting Networks of Evolutionary Processors with Subregular Filters
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
Florin Manea, Bianca Truthe
MST
2007
132views more  MST 2007»
13 years 4 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
INFORMATICALT
2002
77views more  INFORMATICALT 2002»
13 years 5 months ago
A New Algorithm of Constructing the Basis Finite Automaton
In this paper we consider non-deterministic finite Rabin
Boris Melnikov, Alexandra Melnikova
ICDT
2003
ACM
139views Database» more  ICDT 2003»
13 years 10 months ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo
FSTTCS
2006
Springer
13 years 9 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh