Sciweavers

762 search results - page 24 / 153
» Intercode Regular Languages
Sort
View
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CAISE
2008
Springer
13 years 9 months ago
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
Michael zur Muehlen, Jan Recker
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 19 days 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
JCSS
2011
81views more  JCSS 2011»
13 years 2 months ago
Representing real numbers in a generalized numeration system
Abstract. We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider ...
Emilie Charlier, Marion Le Gonidec, Michel Rigo
ICALP
2010
Springer
14 years 6 days ago
Pumping and Counting on the Regular Post Embedding Problem
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
Pierre Chambart, Philippe Schnoebelen