Search results for "Context-Free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
72	Robert Cremanns	Prefix-Rewriting on Context-Free Groups.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	Context-free groups, Generalized word problem, Prefix-rewriting systems, Subgroups, String-rewriting systems
55	Víctor M. Jiménez, Andrés Marzal	Computation of the N Best Parse Trees for Weighted and Stochastic Context-Free Grammars.	SSPR/SPR	2000	DBLP DOI BibTeX RDF	Weighted Context-Free Grammars, CYK Algorithm, N Best Parse Trees, Stochastic Context-Free Grammars
49	Philippe de Groote, Sylvain Pogodalla	On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms.	J. Log. Lang. Inf.	2004	DBLP DOI BibTeX RDF	Abstract categorial grammars, lambda-calculus, context-free grammars, formal language theory
40	Anna Corazza, Giorgio Satta	Probabilistic Context-Free Grammars Estimated from Infinite Distributions.	IEEE Trans. Pattern Anal. Mach. Intell.	2007	DBLP DOI BibTeX RDF	Probabilistic context-free grammars, derivational entropy, expectation-maximization methods, Hidden Markov Models, maximum-likelihood estimation, cross-entropy
40	Henning Bordihn, Markus Holzer 0001	Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems.	LATA	2008	DBLP DOI BibTeX RDF
39	Yoram Hirshfeld, Mark Jerrum, Faron Moller	A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes	FOCS	1994	DBLP DOI BibTeX RDF	normed context-free processes, language equivalence, polynomial-time algorithm, decidability, equivalence, context-free grammars, bisimilarity
39	Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop	Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages.	J. ACM	1993	DBLP DOI BibTeX RDF	bisimulation semantics, simple context-free languages, process algebra, context-free grammars
38	Wissam Khalil	More expressive extensions of TQL.	CSTST	2008	DBLP DOI BibTeX RDF	constraints on unbound-arity trees, context-free tree languages, synchronized context-free tree languages, synchronized regular tree languages, the TQL logic
37	Robert Cremanns, Friedrich Otto	Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time (extended abstract).	ISSAC	1994	DBLP DOI BibTeX RDF
37	Bruno Courcelle	Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas.	RTA	1999	DBLP DOI BibTeX RDF
36	Katsuhiko Nakamura, Masashi Matsumoto	Incremental Learning of Context Free Grammars.	ICGI	2002	DBLP DOI BibTeX RDF	inductive CYK algorithm, unambiguous grammar, incremental learning, context free language, iterative deepening
35	Jan Heering, Paul Klint, J. Rekers	Incremental Generation of Parsers.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	incremental parser generation, LR-based parser generator, arbitrary context-free grammars, input grammar, interactive language definition environments, conventional techniques, performance, algorithms, program compilers, context-free grammars
34	Detlef Wotschke	The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages.	GI Jahrestagung	1973	DBLP DOI BibTeX RDF
34	Susumu Kuno	The augmented predictive analyzer for context-free languages - its relative efficiency.	Commun. ACM	1966	DBLP DOI BibTeX RDF
34	David V. Pynadath, Michael P. Wellman	Generalized Queries on Probabilistic Context-Free Grammars.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	Probabilistic context-free grammars, Bayesian networks
34	Atsuhiro Takasu, Shin'ichi Satoh 0001, Eishi Katsura	A rule learning method for academic document image processing.	ICDAR	1995	DBLP DOI BibTeX RDF	educational administrative data processing, syntactic rule learning method, academic document image processing, CyberMagazine, database tuples, block segmentation, rough classification, two dimensional plane, ordinal context free grammar, symbol concatenation, non terminal symbols, decomposed trees, learning (artificial intelligence), image segmentation, image classification, trees (mathematics), document image processing, computational linguistics, visual databases, visual database, context-free grammars, syntactic analysis, parse trees, digital library system
34	Leo Mark, Roberta Cochrane	Grammars and Relations.	IEEE Trans. Software Eng.	1992	DBLP DOI BibTeX RDF	grammar formalism, grammar-based tools, user interfaces, query processing, relational databases, relational model, context-free grammars, context-free grammars, hierarchical structure, complex objects, relational database systems, front ends, relational queries
33	Klaus Wich	Universal Inherence of Cycle-Free Context-Free Ambiguity Functions.	ICALP	2002	DBLP DOI BibTeX RDF
32	Gend Lal Prajapati, Narendra S. Chaudhari, Manohar Chandwani	Efficient Incremental Model for Learning Context-Free Grammars from Positive Structural Examples.	SETN	2008	DBLP DOI BibTeX RDF	reversible context-free grammar, tree automaton, machine learning, incremental learning, Grammatical inference, structural description
32	Alexander Clark	Learning deterministic context free grammars: The Omphalos competition.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	NTS languages, Grammatical inference, Context Free Languages
32	Haiming Chen, Yunmei Dong	Towards Practical Computable Functions on Context-Free Languages.	TAMC	2006	DBLP DOI BibTeX RDF	computability, operator, structured data, context-free language, recursive function
32	Georgios Petasis, Georgios Paliouras, Constantine D. Spyropoulos, Constantine Halatsis	eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search.	ICGI	2004	DBLP DOI BibTeX RDF	positive examples, genetic algorithms, minimum description length, context-free grammars, grammatical inference
32	Massimiliano Goldwurm, Beatrice Palano, Massimo Santini 0001	On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.	STACS	2001	DBLP DOI BibTeX RDF	Uniform random generation, ambiguous context-free languages, auxiliary pushdown automata, circuit complexity
32	Wojciech Plandowski	Testing Equivalence of Morphisms on Context-Free Languages.	ESA	1994	DBLP DOI BibTeX RDF
31	Robert D. Cameron	Extending Context-Free Grammars with Permutation Phrases.	LOPLAS	1993	DBLP DOI BibTeX RDF	free-order construct, permutation phrase, context-free grammar
30	Martin Kutrib, Andreas Malcher, Detlef Wotschke	The Boolean closure of linear context-free languages.	Acta Informatica	2008	DBLP DOI BibTeX RDF
30	Peter Thiemann 0001, Matthias Neubauer	Macros for context-free grammars.	PPDP	2008	DBLP DOI BibTeX RDF
30	Pál Dömösi, Carlos Martín-Vide, Victor Mitrana	Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages.	Theory Is Forever	2004	DBLP DOI BibTeX RDF
30	Martin Kutrib, Andreas Malcher, Detlef Wotschke	The Boolean Closure of Linear Context-Free Languages.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
30	Friedhelm Hinz	Questions of Decidability for Context-free Chain Code Picture Languages.	IMYCS	1988	DBLP DOI BibTeX RDF
30	Stephen H. Unger	A global parser for context-free phrase structure grammars.	Commun. ACM	1968	DBLP DOI BibTeX RDF	syntax-directed compiler, translators, context-free grammars, parser, syntactic analysis
30	Stephen A. Fenner, William I. Gasarch, Brian Postow	The Complexity of Finding SUBSEQ(A).	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Turing degree, Higman’s lemma, Unbounded search, Recursive mathematics, Computational complexity, Computability, Context-free grammar, Automata theory, Automaton, Context-free language, Subsequence, Reverse mathematics, Bounded queries
29	Meinolf Sellmann	The Theory of Grammar Constraints.	CP	2006	DBLP DOI BibTeX RDF	regular grammar constraints, context-free grammar constraints, constraint filtering, global constraints
29	Lane A. Hemaspaandra, Proshanto Mukherji, Till Tantau	Computation with Absolutely No Space Overhead.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF	space overhead, space reuse, overhead-free computation, deterministic linear languages, metalinear languages, context-free languages, linear space, context-sensitive languages
28	Sara Cohen, Benny Kimelfeld	Querying parse trees of stochastic context-free grammars.	ICDT	2010	DBLP DOI BibTeX RDF	querying, probabilistic databases, stochastic context free grammars
28	Xiaoyong Fang, Zhigang Luo, Zhenghua Wang	Predicting RNA Secondary Structure Using Profile Stochastic Context-Free Grammars and Phylogenic Analysis.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	phylogenic analysis, RNA secondary structure, stochastic context-free grammar
28	Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter	Efficient Computation of Throughput Values of Context-Free Languages.	CIAA	2007	DBLP DOI BibTeX RDF	push-down automaton, minimal mean weight, throughput, context-free grammar
28	Faizan Javed	Inferring context-free grammars for domain-specific languages.	OOPSLA Companion	2005	DBLP DOI BibTeX RDF	data mining, domain-specific languages, context-free grammars, grammar inference
28	Faizan Javed	Inferring context-free grammars for domain-specific languages.	OOPSLA Companion	2005	DBLP DOI BibTeX RDF	data mining, domain-specific languages, context-free grammars, grammar inference
28	Diego Linares, José-Miguel Benedí, Joan-Andreu Sánchez	A hybrid language model based on a combination of N-grams and stochastic context-free grammars.	ACM Trans. Asian Lang. Inf. Process.	2004	DBLP DOI BibTeX RDF	Language model, stochastic context-free grammar
28	Lillian Lee	Fast context-free grammar parsing requires fast boolean matrix multiplication.	J. ACM	2002	DBLP DOI BibTeX RDF	context-free grammar parsing, Boolean matrix multiplication
28	Albert Cohen 0001, Jean-Francois Collard	Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions.	IEEE PACT	1998	DBLP DOI BibTeX RDF	Reaching Definition Analysis, Push-down Transducers, Context-free Languages, Recursive Programs
28	Danny Raz	On Slender Context-free Languages.	STACS	1995	DBLP DOI BibTeX RDF	decidability, formal languages, context-free grammars
28	Anna Corazza, Renato de Mori, Roberto Gretter, Giorgio Satta	Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	context-sensitive grammars, optimal probabilistic evaluation functions, word sequences, probability computation, partial word sequences, best parse tree, cubic time complexity, computational complexity, search, natural language processing, probability, probabilities, language modeling, natural languages, stochastic context-free grammars
27	Klaus Reinhardt	Hierarchies over the Context-Free Languages.	IMYCS	1990	DBLP DOI BibTeX RDF
27	Taisuke Sato	A glimpse of symbolic-statistical modeling by PRISM.	J. Intell. Inf. Syst.	2008	DBLP DOI BibTeX RDF	Symbolic-statistical modeling, Probabilistic context free grammar, PRISM
27	Rajeev Alur, P. Madhusudan	Visibly pushdown languages.	STOC	2004	DBLP DOI BibTeX RDF	?-languages, verification, logic, context-free languages, pushdown automata, regular tree languages
27	Jaroslav Král	A Top-Down No Backtrack Parsing of General Context-Free Languages.	MFCS	1977	DBLP DOI BibTeX RDF
26	Alexander Clark, Rémi Eyraud, Amaury Habrard	A Polynomial Algorithm for the Inference of Context Free Languages.	ICGI	2008	DBLP DOI BibTeX RDF
26	Qian Xi, David Walker 0001	A context-free markup language for semi-structured text.	PLDI	2010	DBLP DOI BibTeX RDF	ANNE, ad hoc data, domain-specific languages, PADS, tool generation
26	Zoltán Ésik, Szabolcs Iván	Context-Free Languages of Countable Words.	ICTAC	2009	DBLP DOI BibTeX RDF
26	Makoto Kanazawa	The Pumping Lemma for Well-Nested Multiple Context-Free Languages.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
26	Ryo Yoshinaka	Identification in the Limit of k, l-Substitutable Context-Free Languages.	ICGI	2008	DBLP DOI BibTeX RDF
26	Xinxin Liu	Expansive-Bisimulation for Context-Free Processes.	Formal Methods and Hybrid Real-Time Systems	2007	DBLP DOI BibTeX RDF
26	Stefan Andrei, Wei-Ngan Chin, Salvador Valerio Cavadini	Self-embedded context-free grammars with regular counterparts.	Acta Informatica	2004	DBLP DOI BibTeX RDF
26	Bradford Starkie, François Coste, Menno van Zaanen	The Omphalos Context-Free Grammar Learning Competition.	ICGI	2004	DBLP DOI BibTeX RDF
26	Henning Bordihn, Markus Holzer 0001, Martin Kutrib	Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.	CIAA	2004	DBLP DOI BibTeX RDF
26	Ahmed Bouajjani, Antoine Meyer	Symbolic Reachability Analysis of Higher-Order Context-Free Processes.	FSTTCS	2004	DBLP DOI BibTeX RDF
26	Anne Brüggemann-Klein, Derick Wood	On Predictive Parsing and Extended Context-Free Grammars.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
26	Anne Brüggemann-Klein, Derick Wood	On Predictive Parsing and Extended Context-Free Grammars.	CIAA	2002	DBLP DOI BibTeX RDF
26	Edward Y. C. Cheng, Michael Kaminski	Context-Free Languages over Infinite Alphabets.	Acta Informatica	1998	DBLP DOI BibTeX RDF
26	Jürgen Albert, Dora Giammarresi, Derick Wood	Extended Context-Free Grammars and Normal Form Algorithms.	Workshop on Implementing Automata	1998	DBLP DOI BibTeX RDF
26	David Melski, Thomas W. Reps	Interconveritibility of Set Constraints and Context-Free Language Reachability.	PEPM	1997	DBLP DOI BibTeX RDF
26	D. J. B. Bosscher, W. O. David Griffioen	Regularity for a Large Class of Context-Free Processes is Decidable.	ICALP	1996	DBLP DOI BibTeX RDF
26	Michal Chytil, Burkhard Monien	Caterpillars and Context-Free Languages.	STACS	1990	DBLP DOI BibTeX RDF
26	R. M. Suresh, S. Arumugam 0001	Fuzzy Technique Based Recognition of Handwritten Characters.	WILF	2003	DBLP DOI BibTeX RDF	Fuzzy Context-free Grammar, Modified Earley’s Parsing Algorithm, Segmentation, Fuzzy Logic, Labeling, Preprocessing, Polygonal Approximation, Handwritten Numerals
25	Tomás Masopust	A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions.	LATA	2009	DBLP DOI BibTeX RDF
25	Masami Ito, Ryo Sugiura	n-Insertion on Languages.	Aspects of Molecular Computing	2004	DBLP DOI BibTeX RDF
24	Daniele Cerra, Mihai Datcu	A Similarity Measure Using Smallest Context-Free Grammars.	DCC	2010	DBLP DOI BibTeX RDF	Compression-based Similarity Measure, Kolmogorov Complexity, Context Free Grammars
24	Faizan Javed, Barrett R. Bryant, Matej Crepinsek, Marjan Mernik, Alan P. Sprague	Context-free grammar induction using genetic programming.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	genetic programming, context-free grammars, grammar-induction
24	Géraud Sénizergues	An Effective Version of Stallings' Theorem in the Case of Context-Free Groups.	ICALP	1993	DBLP DOI BibTeX RDF	context-free groups, Thue-systems, graph of groups, complexity, Cayley graph, pushdown automata
24	Michael G. Thomason	Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF	stochastic, Context-free languages, syntax-directed translations, error detection and correction, schemata
23	Alfred V. Aho	Indexed Grammars - An Extension of Context-Free Grammars.	J. ACM	1968	DBLP DOI BibTeX RDF
23	Klaus Wich	Sublinear Ambiguity.	MFCS	2000	DBLP DOI BibTeX RDF
23	Maria Bulinska	On the Complexity of Nonassociative Lambek Calculus with Unit.	Stud Logica	2009	DBLP DOI BibTeX RDF	Nonassociative Lambek calculus, P-TIME decidability, Context-free grammar
23	Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter Hooimeijer, Michael D. Ernst	HAMPI: a solver for string constraints.	ISSTA	2009	DBLP DOI BibTeX RDF	string constraints, regular languages, context-free languages
23	Douglas Adriano Augusto, Helio J. C. Barbosa, Nelson F. F. Ebecken	Coevolution of data samples and classifiers integrated with grammatically-based genetic programming for data classification.	GECCO	2008	DBLP DOI BibTeX RDF	competitive coevolution, genetic programming, context-free grammar, data classification
23	Denis Béchet, Annie Foret, Isabelle Tellier	Learnability of Pregroup Grammars.	ICGI	2004	DBLP DOI BibTeX RDF	Learning from positive examples, Computational linguistics, Context-Free grammars, Categorial Grammars, Pregroup grammars
23	John Kodumal, Alexander Aiken	The set constraint/CFL reachability connection in practice.	PLDI	2004	DBLP DOI BibTeX RDF	flow analysis, type qualifiers, set constraints, context-free language reachability
23	Zoltán Ésik, Hans Leiß	Greibach Normal Form in Algebraically Complete Semirings.	CSL	2002	DBLP DOI BibTeX RDF	Greibach normal form, pre-fixed-point induction, Conway algebra, algebraically complete semirings, context-free languages, Kleene algebra, equational theory
23	Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa	Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.	ICALP	2001	DBLP DOI BibTeX RDF	Reversal-bounded counters, commutation of languages, context-free languages, combinatorics on words, morphisms
23	Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini 0001	Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.	STACS	2000	DBLP DOI BibTeX RDF	uniform random generation, auxiliary pushdown automata, rational trace languages, inherent ambiguity, context-free languages, approximate counting
23	Anton Nijholt	On the Covering of Left Recursive Grammars.	POPL	1977	DBLP DOI BibTeX RDF	left-recursion, parsing, grammar, cover, context-free
23	Tikara Hosino, Kazuho Watanabe, Sumio Watanabe	Free Energy of Stochastic Context Free Grammar on Variational Bayes.	ICONIP (1)	2006	DBLP DOI BibTeX RDF
22	Smriti Kumar Sinha, Azzedine Benameur	A formal solution to rewriting attacks on SOAP messages.	SWS	2008	DBLP DOI BibTeX RDF	context-free signature, context-sensitive signature, regular tree grammar, xml rewriting attacks, security, formal methods, soap
22	Claus Brabrand, Robert Giegerich, Anders Møller	Analyzing Ambiguity of Context-Free Grammars.	CIAA	2007	DBLP DOI BibTeX RDF	CFG ambiguity, regular approximation, RNA analysis
22	Anshuman Singh, Siddharth Barman, Kaushal K. Shukla	Secure Two-Party Context Free Language Recognition.	ICDCIT	2005	DBLP DOI BibTeX RDF
22	Karin Harbusch	An Efficient Online Parser for Contextual Grammars with at Most Context-Free Selectors.	CICLing	2003	DBLP DOI BibTeX RDF
22	Sabine Broda, Luís Damas	A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda.	EPIA	2001	DBLP DOI BibTeX RDF
22	Arun K. Jagota, Rune B. Lyngsø, Christian N. S. Pedersen	Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar.	WABI	2001	DBLP DOI BibTeX RDF
22	Joost Engelfriet, Jan Joris Vereijken	Context-Free Graph Grammars and Concatenation of Graphs.	Acta Informatica	1997	DBLP DOI BibTeX RDF
22	Géraud Sénizergues	Semi-Groups Acting on Context-Free Graphs.	ICALP	1996	DBLP DOI BibTeX RDF	infinite graphs, ends, semi-groups, groups, bisimulations, pushdown automata, automorphisms
22	Günter Hotz, Gisela Pitsch	A New Approach to Analyse Coupled-Context-Free Languages.	MFCS	1995	DBLP DOI BibTeX RDF
22	Günter Hotz, Gisela Pitsch	Fast Uniform Analysis of Coupled-Context-Free Languages.	ICALP	1994	DBLP DOI BibTeX RDF
22	Dieter Hofbauer, Maria Huber, Gregory Kucherov	Some Results on Top-Context-Free Tree Languages.	CAAP	1994	DBLP DOI BibTeX RDF
22	Andrey Burago	Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time.	COLT	1994	DBLP DOI BibTeX RDF
22	Matthias Jantzen, Holger Petersen 0001	Cancellation on Context-Free Languages: Enrichment by Reduction.	STACS	1993	DBLP DOI BibTeX RDF
22	Joost Engelfriet	A Greibach Normal Form for Context-free Graph Grammars.	ICALP	1992	DBLP DOI BibTeX RDF
22	Clemens Lautemann	Efficient Algorithms on Context-Free Graph Grammars.	ICALP	1988	DBLP DOI BibTeX RDF
22	Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini	Computing the Counting Function of Context-Free Languages.	STACS	1987	DBLP DOI BibTeX RDF