Sciweavers

759 search results - page 8 / 152
» Overlap-Free Regular Languages
Sort
View
IFIP
2004
Springer
14 years 1 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch
FCT
2007
Springer
14 years 2 months ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick
STOC
2005
ACM
85views Algorithms» more  STOC 2005»
14 years 8 months ago
Tree-walking automata do not recognize all regular languages
Mikolaj Bojanczyk, Thomas Colcombet