Sciweavers

278 search results - page 21 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
IANDC
2010
132views more  IANDC 2010»
13 years 4 months ago
The expressive power of the shuffle product
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Er...
FOSSACS
2011
Springer
12 years 11 months ago
Regularity and Context-Freeness over Word Rewriting Systems
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivat...
Didier Caucal, Dinh Trong Hieu
POPL
2004
ACM
14 years 7 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
FSMNLP
2005
Springer
14 years 1 months ago
A Programming Language for Finite State Transducers
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...
Helmut Schmid
CP
2000
Springer
13 years 12 months ago
A Language for Audiovisual Template Specification and Recognition
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
Jean Carrive, Pierre Roy, François Pachet, ...