Javier Esparza, Peter Rossmanith, Stefan Schwoon  Home/Search
Context Related
| informatik.unistuttgart...ufpcfg.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unistuttgart.de/fm... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In [2], Bouajjani and others presented an automata-based approach to a number of elementary problems on context-free grammars. This approach is of pedagogical interest since it provides a uniform solution to decision procedures usually solved by independent algorithms in textbooks, e.g. [7]. (Update)
Context of citations to this paper: More
...accepting the set of descendants. The time and space complexities of the original algorithm by Book and Otto are later improved ([4,3,5]) Esparza et al. 5] prove O(ps 3 ) time and O(ps 2 ) space bounds where p is the number of rules in the monadic string rewriting system...
...accepting the set of descendants. The time and space complexities of the original algorithm by Book and Otto are later improved ([4,3,5]) Esparza et al. 5] prove O(ps ) time and O(ps ) space bounds where p is the number of rules in the monadic string rewriting system and...
Cited by: More
The Theory of Finite-State Adventures - Brauer, Holzer, König, Schwoon (Correct)
On SE-Systems and Monadic String Rewriting Systems - Tiplea, Mäkinen (2000) (Correct)
Active bibliography (related documents): More All
0.9: A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (Correct)
0.2: Static Analysis and Computer Security: . . . - Wagner (2000) (Correct)
0.2: An Efficient Automata Approach to Some Problems on .. - Bouajjani.. (2000) (Correct)
Similar documents based on text: More All
0.8: Efficient Algorithms for Model Checking Pushdown Systems - Esparza, Hansel.. (2000) (Correct)
0.4: A BDD-based Model Checker for Recursive Programs - Esparza, Schwoon (2001) (Correct)
0.2: Assembling Molecules in Atomix is Hard - Holzer, Schwoon (2001) (Correct)
Related documents from co-citation: More All
2: String Rewriting Systems (context) - Book, Otto - 1993
2: An Automata Approach to Some Problems on Context-free Grammars - Esparza, Rossmanith - 1997
2: Cancellation rules and extended word problems (context) - Book, Otto - 1985
BibTeX entry: (Update)
J. Esparza, P. Rossmanith, S. Schwoon, A uniform framework for problems on context-free grammars. Bull. EATCS 72 (2000), 169-177. http://citeseer.ist.psu.edu/article/esparza00uniform.html More
@article{ esparza00uniform,
author = "J. Esparza and P. Rossmanith and S. Schwoon",
title = "A Uniform Framework for Problems on Context-Free Grammars",
journal = "Bulletin of the European Association for Theoretical Computer Science",
volume = "72",
pages = "169--",
year = "2000",
url = "citeseer.ist.psu.edu/article/esparza00uniform.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
87 Recognition and parsing of context-free languages in time n (context) - Younger - 1967
26 Texts and Monographs in Computer Science (context) - Book, Otto - 1993
21 An ecient context-free parsing algorithm (context) - Earley - 1970
17 the regular structure of pre x rewriting (context) - Caucal - 1992
10 An automata approach to some problems on context-free gramma.. - Esparza, Rossmanith - 1997
7 An ecient automata approach to some problems on contextfree .. - Bouajjani, Esparza et al. - 2000
5 An ecient recognition and syntax algorithm for context-free .. (context) - Kasami - 1965
3 Regular canonical systems and nite automata (context) - uchi - 1964
Documents on the same site (http://www.informatik.uni-stuttgart.de/fmi/szs/publications/esparza/): More
Simple Representative Instantiations for Multicast Protocols - Esparza, Maidl (2003) (Correct)
Reachability in Live and Safe Free-Choice Petri Nets is NP-complete - Esparza (1996) (Correct)
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC