|
|
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 |
72 | Robert Cremanns |
Prefix-Rewriting on Context-Free Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(4), pp. 315-344, 1997. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30 - September 1, 2000, Proceedings, pp. 183-192, 2000, Springer, 3-540-67946-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 13(4), pp. 421-438, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 29(8), pp. 1379-1393, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 125-136, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Yoram Hirshfeld, Mark Jerrum, Faron Moller |
A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 623-631, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 40(3), pp. 653-682, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
bisimulation semantics, simple context-free languages, process algebra, context-free grammars |
38 | Wissam Khalil |
More expressive extensions of TQL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSTST ![In: CSTST 2008: Proceedings of the 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, Cergy-Pontoise, France, October 28-31, 2008, pp. 607-612, 2008, ACM, 978-1-60558-046-3. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, Oxford, UK, July 20-22, 1994, pp. 147-153, 1994, ACM, 0-89791-638-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
37 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 90-91, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
36 | Katsuhiko Nakamura, Masashi Matsumoto |
Incremental Learning of Context Free Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 6th International Colloquium: ICGI 2002, Amsterdam, The Netherlands, September 23-25, 2002, Proceedings, pp. 174-184, 2002, Springer, 3-540-44239-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(12), pp. 1344-1351, 1990. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GI Jahrestagung ![In: Gesellschaft für Informatik e.V., 3. Jahrestagung, Hamburg, Deutschland, 8.-10. Oktober 1973, pp. 113-121, 1973, Springer, 3-540-06473-7. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
34 | Susumu Kuno |
The augmented predictive analyzer for context-free languages - its relative efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 9(11), pp. 810-823, 1966. The full citation details ...](Pics/full.jpeg) |
1966 |
DBLP DOI BibTeX RDF |
|
34 | David V. Pynadath, Michael P. Wellman |
Generalized Queries on Probabilistic Context-Free Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(1), pp. 65-77, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: Third International Conference on Document Analysis and Recognition, ICDAR 1995, August 14 - 15, 1995, Montreal, Canada. Volume I, pp. 239-242, 1995, IEEE Computer Society, 0-8186-7128-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 18(9), pp. 840-849, 1992. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 669-680, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETN ![In: Artificial Intelligence: Theories, Models and Applications, 5th Hellenic Conference on AI, SETN 2008, Syros, Greece, October 2-4, 2008. Proceedings, pp. 250-262, 2008, Springer, 978-3-540-87880-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 66(1), pp. 93-110, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 555-565, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004, Proceedings, pp. 223-234, 2004, Springer, 3-540-23410-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 305-316, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 460-470, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Robert D. Cameron |
Extending Context-Free Grammars with Permutation Phrases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPLAS ![In: LOPLAS 2(1-4), pp. 85-94, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 45(3), pp. 177-191, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
30 | Peter Thiemann 0001, Matthias Neubauer |
Macros for context-free grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain, pp. 120-130, 2008, ACM, 978-1-60558-117-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Is Forever ![In: Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, pp. 60-67, 2004, Springer, 3-540-22393-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Martin Kutrib, Andreas Malcher, Detlef Wotschke |
The Boolean Closure of Linear Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, pp. 284-295, 2004, Springer, 3-540-24014-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Friedhelm Hinz |
Questions of Decidability for Context-free Chain Code Picture Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMYCS ![In: Machines, Languages, and Complexity, 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Proceedings, pp. 2-11, 1988, Springer, 3-540-51516-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
30 | Stephen H. Unger |
A global parser for context-free phrase structure grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(4), pp. 240-247, 1968. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 577-612, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 530-544, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings, pp. 325-336, 2003, Springer, 3-540-40434-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings, pp. 62-75, 2010, ACM, 978-1-60558-947-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(4), pp. 582-589, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, pp. 203-213, 2007, Springer, 978-3-540-76335-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA Companion ![In: Companion to the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2005, October 16-20, 2005, San Diego, CA, USA, pp. 212-213, 2005, ACM, 1-59593-193-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA Companion ![In: Companion to the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2005, October 16-20, 2005, San Diego, CA, USA, pp. 242-243, 2005, ACM, 1-59593-193-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Asian Lang. Inf. Process. ![In: ACM Trans. Asian Lang. Inf. Process. 3(2), pp. 113-127, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Language model, stochastic context-free grammar |
28 | Lillian Lee |
Fast context-free grammar parsing requires fast boolean matrix multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(1), pp. 1-15, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE PACT ![In: Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998, pp. 332-339, 1998, IEEE Computer Society, 0-8186-8591-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Reaching Definition Analysis, Push-down Transducers, Context-free Languages, Recursive Programs |
28 | Danny Raz |
On Slender Context-free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 445-454, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(10), pp. 1018-1027, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMYCS ![In: Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings, pp. 214-224, 1990, Springer, 3-540-53414-8. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Taisuke Sato |
A glimpse of symbolic-statistical modeling by PRISM. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 31(2), pp. 161-176, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Symbolic-statistical modeling, Probabilistic context free grammar, PRISM |
27 | Rajeev Alur, P. Madhusudan |
Visibly pushdown languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 202-211, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings, pp. 333-341, 1977, Springer, 0-387-08353-7. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Clark, Rémi Eyraud, Amaury Habrard |
A Polynomial Algorithm for the Inference of Context Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings, pp. 29-42, 2008, Springer, 978-3-540-88008-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Qian Xi, David Walker 0001 |
A context-free markup language for semi-structured text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, June 5-10, 2010, pp. 221-232, 2010, ACM, 978-1-4503-0019-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings, pp. 185-199, 2009, Springer, 978-3-642-03465-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Makoto Kanazawa |
The Pumping Lemma for Well-Nested Multiple Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings, pp. 312-325, 2009, Springer, 978-3-642-02736-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Ryo Yoshinaka |
Identification in the Limit of k, l-Substitutable Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008, Proceedings, pp. 266-279, 2008, Springer, 978-3-540-88008-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Xinxin Liu |
Expansive-Bisimulation for Context-Free Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods and Hybrid Real-Time Systems ![In: Formal Methods and Hybrid Real-Time Systems, Essays in Honor of Dines Bjørner and Chaochen Zhou on the Occasion of Their 70th Birthdays, Papers presented at a Symposium held in Macao, China, September 24-25, 2007, pp. 472-482, 2007, Springer, 978-3-540-75220-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Stefan Andrei, Wei-Ngan Chin, Salvador Valerio Cavadini |
Self-embedded context-free grammars with regular counterparts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 40(5), pp. 349-365, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Bradford Starkie, François Coste, Menno van Zaanen |
The Omphalos Context-Free Grammar Learning Competition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004, Proceedings, pp. 16-27, 2004, Springer, 3-540-23410-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 68-79, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Ahmed Bouajjani, Antoine Meyer |
Symbolic Reachability Analysis of Higher-Order Context-Free Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 135-147, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Anne Brüggemann-Klein, Derick Wood |
On Predictive Parsing and Extended Context-Free Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computer Science in Perspective ![In: Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, pp. 69-87, 2003, Springer, 3-540-00579-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Anne Brüggemann-Klein, Derick Wood |
On Predictive Parsing and Extended Context-Free Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers, pp. 239-247, 2002, Springer, 3-540-40391-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Edward Y. C. Cheng, Michael Kaminski |
Context-Free Languages over Infinite Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(3), pp. 245-267, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Jürgen Albert, Dora Giammarresi, Derick Wood |
Extended Context-Free Grammars and Normal Form Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Implementing Automata ![In: Automata Implementation, Third International Workshop on Implementing Automata, WIA'98, Rouen, France, September 17-19, 1998, Revised Papers, pp. 1-12, 1998, Springer, 3-540-66652-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | David Melski, Thomas W. Reps |
Interconveritibility of Set Constraints and Context-Free Language Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97), Amsterdam, The Netherlands, June 12-13, 1997, pp. 74-89, 1997, ACM, 0-89791-917-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 182-193, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Michal Chytil, Burkhard Monien |
Caterpillars and Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 70-81, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
26 | R. M. Suresh, S. Arumugam 0001 |
Fuzzy Technique Based Recognition of Handwritten Characters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WILF ![In: Fuzzy Logic and Applications, 5th International Workshop, WILF 2003, Naples, Italy, October 9-11, 2003, Revised Selected Papers, pp. 297-308, 2003, Springer, 3-540-31019-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp. 554-565, 2009, Springer, 978-3-642-00981-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Masami Ito, Ryo Sugiura |
n-Insertion on Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Aspects of Molecular Computing ![In: Aspects of Molecular Computing, Essays Dedicated to Tom Head on the Occasion of His 70th Birthday, pp. 213-218, 2004, Springer, 3-540-20781-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Daniele Cerra, Mihai Datcu |
A Similarity Measure Using Smallest Context-Free Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2010 Data Compression Conference (DCC 2010), 24-26 March 2010, Snowbird, UT, USA, pp. 346-355, 2010, IEEE Computer Society, 978-0-7695-3994-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 42nd Annual Southeast Regional Conference, 2004, Huntsville, Alabama, USA, April 2-3, 2004, pp. 404-405, 2004, ACM, 1-58113-870-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 478-495, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 24(12), pp. 1211-1216, 1975. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 15(4), pp. 647-671, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
|
23 | Klaus Wich |
Sublinear Ambiguity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 690-698, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Maria Bulinska |
On the Complexity of Nonassociative Lambek Calculus with Unit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 93(1), pp. 1-14, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the Eighteenth International Symposium on Software Testing and Analysis, ISSTA 2009, Chicago, IL, USA, July 19-23, 2009, pp. 105-116, 2009, ACM, 978-1-60558-338-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 1171-1178, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGI ![In: Grammatical Inference: Algorithms and Applications, 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004, Proceedings, pp. 65-76, 2004, Springer, 3-540-23410-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 207-218, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 135-150, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 579-590, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 567-580, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 86-96, 1977, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (1) ![In: Neural Information Processing, 13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings, Part I, pp. 407-416, 2006, Springer, 3-540-46479-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Smriti Kumar Sinha, Azzedine Benameur |
A formal solution to rewriting attacks on SOAP messages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWS ![In: Proceedings of the 5th ACM Workshop On Secure Web Services, SWS 2008, Alexandria, VA, USA, October 31, 2008, pp. 53-60, 2008, ACM, 978-1-60558-292-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, pp. 214-225, 2007, Springer, 978-3-540-76335-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, Second International Conference, ICDCIT 2005, Bhubaneswar, India, December 22-24, 2005, Proceedings, pp. 117-124, 2005, Springer, 3-540-30999-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Karin Harbusch |
An Efficient Online Parser for Contextual Grammars with at Most Context-Free Selectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CICLing ![In: Computational Linguistics and Intelligent Text Processing, 4th International Conference, CICLing 2003, Mexico City, Mexico, February 16-22, 2003, Proceedings, pp. 168-179, 2003, Springer, 3-540-00532-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Sabine Broda, Luís Damas |
A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPIA ![In: Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving, 10th Portuguese Conference on Artificial Intelligence, EPIA 2001, Porto, Portugal, December 17-20, 2001, Proceedings, pp. 321-334, 2001, Springer, 3-540-43030-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 69-94, 2001, Springer, 3-540-42516-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Joost Engelfriet, Jan Joris Vereijken |
Context-Free Graph Grammars and Concatenation of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 34(10), pp. 773-803, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
22 | Géraud Sénizergues |
Semi-Groups Acting on Context-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 206-218, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings, pp. 349-358, 1995, Springer, 3-540-60246-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
22 | Günter Hotz, Gisela Pitsch |
Fast Uniform Analysis of Coupled-Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 412-423, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Dieter Hofbauer, Maria Huber, Gregory Kucherov |
Some Results on Top-Context-Free Tree Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings, pp. 157-171, 1994, Springer, 3-540-57879-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Andrey Burago |
Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 140-146, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
22 | Matthias Jantzen, Holger Petersen 0001 |
Cancellation on Context-Free Languages: Enrichment by Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 206-215, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
22 | Joost Engelfriet |
A Greibach Normal Form for Context-free Graph Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 138-149, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
22 | Clemens Lautemann |
Efficient Algorithms on Context-Free Graph Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 362-378, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
22 | Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini |
Computing the Counting Function of Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 169-179, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|