J. Esparza, P. Rossmanith  Home/Search
Context Related
| informatik.unistut...festschrift.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 Chapter 4 of [?], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automatabased technique. In this note we observe that the technique is also very interesting from a pedagogical point of view, since it provides a uniform solution to several elementary problems on context-free languages. We hope that Wilfried Brauer will consider these results for inclusion in the next edition of his textbook on automata theory [?]. 1 (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 ) time and O(ps ) space bounds where p is the number of rules in the monadic string rewriting system and...
Cited by: More
An Ecient Automata Approach to Some - Problems On Context-Free (Correct)
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (Correct)
An Efficient Automata Approach to Some Problems on .. - Bouajjani.. (2000) (Correct)
Similar documents (at the sentence level):
75.8%: An Automata Approach to Some Problems on Context-Free Grammars - Esparza, Rossmanith (1997) (Correct)
36.2%: An Automata Approach to Some Problems on - Context-Free Grammars Esparza (Correct)
Active bibliography (related documents): More All
0.0: Trace Rewriting: Computing normal forms in time O(n log n) - Bertol, Diekert (1996) (Correct)
0.0: Checking Simple Properties of Transition Systems Defined by Thue.. - Knapik (Correct)
0.0: Restarting automata, Church-Rosser languages, and confluent.. - Niemann, Otto (1999) (Correct)
Similar documents based on text: More All
0.2: Combining Symbolic and Partial Order Methods for Model Checking.. - Heljanko (2002) (Correct)
0.2: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
0.1: On the model checking problem for branching time logics and.. - Esparza, Kiehn (1995) (Correct)
Related documents from co-citation: More All
8: Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
6: the Regular Structure of Prex Rewriting (context) - Caucal - 1992
6: Texts and Monographs in Computer Science (context) - Book, Otto et al. - 1993
BibTeX entry: (Update)
J. Esparza and P. Rossmanith. An Automata Approach to Some Problems on Context-free Grammars. Foundations of Computer Science: Potential, Theory, Cognition, C. Freksa, M. Jantzen, R. Valk (eds.), LNCS 1337, 143-152 (1997). http://citeseer.ist.psu.edu/esparza97automata.html More
@article{ esparza97automata,
author = "Javier Esparza and Peter Rossmanith",
title = "An Automata Approach to Some Problems on Context-Free Grammars",
journal = "Lecture Notes in Computer Science",
volume = "1337",
pages = "143--??",
year = "1997",
url = "citeseer.ist.psu.edu/esparza97automata.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1976
151 Reachability analysis of pushdown automata: Application to m.. - Bouajjani, Esparza et al.
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
3 Reachability analysis of pushdown automata Proceedings of IN.. (context) - Bouajjani, Maler - 1996
The graph only includes citing articles where the year of publication is known.
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