Sciweavers

JMLR
2010
134views more  JMLR 2010»
13 years 5 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...
DLT
2009
13 years 8 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
Makoto Kanazawa
JACM
2000
73views more  JACM 2000»
13 years 10 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
JALC
2007
84views more  JALC 2007»
13 years 10 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
ENTCS
2010
90views more  ENTCS 2010»
13 years 11 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
ICGI
2010
Springer
13 years 12 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
FSTTCS
2008
Springer
13 years 12 months ago
Boolean algebras of unambiguous context-free languages
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Didier Caucal
CAV
2010
Springer
181views Hardware» more  CAV 2010»
14 years 2 months ago
Bounded Underapproximations
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L L which has the same...
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
MFCS
2001
Springer
14 years 3 months ago
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
Klaus Wich
STACS
2009
Springer
14 years 5 months ago
The Dynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick