The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Context-Free (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1959-1966 (25) 1967 (18) 1968 (17) 1969 (21) 1970 (15) 1971-1972 (33) 1973 (20) 1974 (24) 1975 (28) 1976 (25) 1977 (29) 1978 (22) 1979 (32) 1980 (23) 1981 (29) 1982 (24) 1983 (21) 1984 (19) 1985 (25) 1986 (19) 1987 (28) 1988 (41) 1989 (32) 1990 (37) 1991 (48) 1992 (56) 1993 (30) 1994 (72) 1995 (54) 1996 (45) 1997 (67) 1998 (50) 1999 (44) 2000 (78) 2001 (89) 2002 (87) 2003 (84) 2004 (103) 2005 (117) 2006 (110) 2007 (142) 2008 (131) 2009 (101) 2010 (69) 2011 (63) 2012 (61) 2013 (64) 2014 (65) 2015 (70) 2016 (63) 2017 (45) 2018 (50) 2019 (50) 2020 (62) 2021 (59) 2022 (47) 2023 (51) 2024 (10)
Publication types (Num. hits)
article(1188) book(3) incollection(16) inproceedings(1709) phdthesis(28)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 819 occurrences of 509 keywords

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