Results 1  10
of
422,501
Growthsensitivity of contextfree languages
, 2003
"... A language L over a finite alphabet is called growthsensitive if forbidding any set of subwords F yields a sublanguage L F whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic nonlinear contextfree language of convergent type is growthsensitive. ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
A language L over a finite alphabet is called growthsensitive if forbidding any set of subwords F yields a sublanguage L F whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic nonlinear contextfree language of convergent type is growth
ContextFree Language Induction by
"... The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on ContextFree Languages (CFL&a ..."
Abstract
 Add to MetaCart
The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on ContextFree Languages (CFL
Ordered ContextFree Grammars
"... Contextfree grammars (CFGs) provide an intuitive and powerful formalism for describing the syntactic structure of parsable input streams. Unfortunately, existing online parsing algorithms for such streams admit only a subset of possible CFG descriptions. Theoretically, it is possible to parse any ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
deterministic contextfree language (CFL) in a single pass, as long as the grammar describing the CFL belongs to the LR(k), k ≥ 1 subset of CFGs. However, obtaining a suitable LR(k) description for a language is not an easy task — especially when k = 1 — and usually entails an increase in complexity
Universal coalgebra: a theory of systems
, 2000
"... In the semantics of programming, nite data types such as finite lists, have traditionally been modelled by initial algebras. Later final coalgebras were used in order to deal with in finite data types. Coalgebras, which are the dual of algebras, turned out to be suited, moreover, as models for certa ..."
Abstract

Cited by 407 (42 self)
 Add to MetaCart
for certain types of automata and more generally, for (transition and dynamical) systems. An important property of initial algebras is that they satisfy the familiar principle of induction. Such a principle was missing for coalgebras until the work of Aczel (NonWellFounded sets, CSLI Leethre Notes, Vol. 14
Interconvertibility of Set Constraints and ContextFree Language Reachability
 In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and SemanticsBased Program Manipulation
, 1996
"... We show the interconvertibility of contextfreelanguage reachability problems and a class of setconstraint problems: given a contextfreelanguage reachability problem, we show how to construct a setconstraint problem whose answer gives a solution to the reachability problem; given a setconstrai ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We show the interconvertibility of contextfreelanguage reachability problems and a class of setconstraint problems: given a contextfreelanguage reachability problem, we show how to construct a setconstraint problem whose answer gives a solution to the reachability problem; given a set
Inductive Inference of Contextfree Languages
"... An inductive inference problem of contextfree languages is investigated. There have been many attempts to this problem, and most of them are based on a problem setting in which a representation space for hypotheses is a class of contextfree grammars. An inference algorithm given in this paper, on ..."
Abstract
 Add to MetaCart
An inductive inference problem of contextfree languages is investigated. There have been many attempts to this problem, and most of them are based on a problem setting in which a representation space for hypotheses is a class of contextfree grammars. An inference algorithm given in this paper
TECHNIQUES FOR CONTEXTFREE GRAMMAR INDUCTION AND APPLICATIONS
, 2007
"... Grammar Inference is the process of learning a grammar from examples, either positive (i.e., the grammar generates the string) and/or negative (i.e., the grammar does not generate the string). Although grammar inference has been successfully applied to many diverse domains such as speech recognitio ..."
Abstract
 Add to MetaCart
recognition and robotics, its application to software engineering has been limited. This research investigates the applicability of grammar inference to software engineering and programming language development challenge problems, where grammar inference offers an innovative solution to the problem, while
On the Computational Complexity of Synchronized ContextFree Languages 1
"... Abstract: We introduce counter synchronized contextfree grammars and investigate their generative power. It turns out that the family of counter synchronized contextfree languages is a proper superset of the family of contextfree languages and is strictly contained in the family of synchronized c ..."
Abstract
 Add to MetaCart
Abstract: We introduce counter synchronized contextfree grammars and investigate their generative power. It turns out that the family of counter synchronized contextfree languages is a proper superset of the family of contextfree languages and is strictly contained in the family of synchronized
Certified CYK parsing of contextfree languagesI
"... We report a work on certified parsing for contextfree grammars. In our development we implement the Cocke–Younger–Kasami parsing algorithm and prove it correct using the Agda dependently typed programming language. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We report a work on certified parsing for contextfree grammars. In our development we implement the Cocke–Younger–Kasami parsing algorithm and prove it correct using the Agda dependently typed programming language.
Results 1  10
of
422,501