Problems on Context-Free Grammars Ahmed Bouajjani Javier Esparza Alain Finkel ...  Home/Search
Context
Related
| lti.informatik.rwt...jani00efficient.ps 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: lti.informatik....lications.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based 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. (Update)
Similar documents (at the sentence level):
18.4%: An Automata Approach to Some Problems on - Context-Free Grammars Esparza (Correct)
16.9%: An Automata Approach to Some Problems on Context-Free Grammars - Esparza, Rossmanith (1997) (Correct)
Active bibliography (related documents): More All
0.7: An Efficient Automata Approach to Some Problems on .. - Bouajjani.. (2000) (Correct)
0.2: A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (Correct)
0.1: Static Analysis and Computer Security: . . . - Wagner (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ context-free-ecient,
author = "Problems On Context-Free",
title = "An Ecient Automata Approach to Some",
url = "citeseer.ist.psu.edu/748731.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. - 1997
87 Recognition and Parsing of Context-free Languages in time n (context) - Younger
84 A Direct Symbolic Approach to Modelchecking Pushdown Systems - Finkel, Willems et al. - 1997
26 Texts and Monographs in Computer Science (context) - Book, Otto - 1993
18 Reachability Analysis of Pushdown Automata (context) - Bouajjani, Maler - 1996
17 the Regular Structure of Pre x Rewriting (context) - Caucal - 1992
17 Linear-time Algorithms for Testing the Satis ability of Prop.. (context) - Dowling, Gallier - 1984
11 Their Algebras and Grammars (context) - uchi - 1988
10 An Automata Approach to Some Problems on Context-free Gramma.. - Esparza, Rossmanith - 1997
3 Regular Canonical Systems and Finite Automata (context) - uchi - 1964
Documents on the same site (http://www-lti.informatik.rwth-aachen.de/pub/publications.shtml): More
New Upper Bounds for Maximum Satisfiability - Niedermeier, Rossmanith (2000) (Correct)
k-Variable Pattern Languages Efficiently Stochastically.. - Rossmanith, Zeugmann (1998) (Correct)
A Uniform Framework for Problems on Context-Free Grammars - Esparza, Rossmanith, Schwoon (2000) (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