Jean-Michel Autebert, Jean Berstel, Luc Boasson  Home/Search
Context Related
| igm.univmlv.fr/%7Eberstel/...CFLPDA.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: igm.univmlv.fr/~bers...Recherche (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1. Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.1 Grammars : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.2 Examples : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2. Systems of equations : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.1 Systems : : : : : : : : : : : : : : : : : : : ... (Update)
Cited by: More
Concatenation State Machines and - Simple Functions Wojciech (Correct)
A Characterization of S-Languages - Wojciech Fraczak And (Correct)
On Monotonic Automata with a Restart Operation - Jancar, Mraz, Plátek, Vogel (1999) (Correct)
Similar documents (at the sentence level):
78.8%: Context-Free Languages and Push-Down Automata - Autebert, Berstel, Boasson (1997) (Correct)
Active bibliography (related documents): More All
0.7: Conditional Context-Free Languages of Finite Index - Fernau, Holzer (Correct)
0.5: Flip-Pushdown Automata: Nondeterminism is Better than Determinism - Holzer, Kutrib (2003) (Correct)
0.4: The Tree Equivalence of Linear Recursion Schemes - Sabelfeld (Correct)
Similar documents based on text: More All
0.6: Grammars with Generalized Contextfree Rules and Their Tree Automata - Volger (1999) (Correct)
0.5: Greibach Normal Form Transformation, Revisited - Blum, Koch (1997) (Correct)
0.5: List of Symbols - Blackboard Curved Less (Correct)
Related documents from co-citation: More All
6: Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
6: Regulated Rewriting in Formal Language Theory (context) - Dassow, Paun - 1989
5: Formal Languages (context) - Salomaa - 1973
BibTeX entry: (Update)
J.-M. Autebert, J. Berstel, and L. Boasson. Context-free languages and pushdown automata. In R. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, chapter 3. Springer Verlag, Berlin Heidelberg, 1997. http://citeseer.ist.psu.edu/autebert97contextfree.html More
@incollection{ autebert97contextfree,
author = "J. Autebert and J. Berstel and L. Boasson",
title = "Context-Free Languages and Pushdown Automata",
booktitle = "Handbook of Formal Languages",
volume = "1, Word Language Grammar",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "A. Salomaa and G. Rozenberg",
pages = "111--174",
year = "1997",
url = "citeseer.ist.psu.edu/autebert97contextfree.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
220 Formal Languages (context) - Salomaa - 1973
197 Transductions and Context-Free Languages (context) - Berstel - 1979
191 Introduction to Formal Language Theory (context) - Harrison - 1978
134 Formal Languages and Their Relation to Automata (context) - Hopcroft, Ullman - 1969
77 Translation and Compiling (context) - Aho, Ullman et al. - 1973
76 The Mathematical Theory of Context-Free Languages (context) - Ginsburg - 1966
64 On context-free languages (context) - Parikh - 1966
58 the translation of languages from left to right (context) - Knuth - 1965
48 On certain formal properties of grammars (context) - Chomsky - 1959
35 The algebraic theory of context-free languages (context) - Chomsky, Schutzenberger - 1963
23 Simple deterministic languages (context) - Korenjack, Hopcroft - 1966
19 Transductions des langages de Chomsky (context) - Nivat - 1967
19 EATCS Monographs on Theoretical Computer Science (context) - Sippu, Soisalon-Soininen et al. - 1988
19 Transductions des langages de Chomsky (context) - Nivat - 1968
18 Parenthesis grammars (context) - McNaughton - 1967
17 The hardest context-free language (context) - Greibach - 1973
15 Bracketed context-free languages (context) - Ginsburg, Harrison - 1967
12 A new normal form theorem for context-free phrase structure .. (context) - Greibach - 1965
11 Syntactic analysis and operator precedence (context) - Floyd - 1963
11 Syntax-directed transduction (context) - Lewis, Stearns - 1968
11 Two families of languages related to ALGOL (context) - Ginsburg, Rice - 1962
10 A characterization of parenthesis languages (context) - Knuth - 1967
10 Finite-turn pushdown automata (context) - Ginsburg, Spanier - 1966
8 On context-free languages and pushdown automata (context) - Schutzenberger - 1963
8 The equivalence problem for deterministic finite turn pushdo.. (context) - Valiant - 1974
6 Commutative regular equations and Parikh's theorem (context) - Pilling - 1973
6 Normal form transformations of context-free grammars (context) - Hotz - 1978
5 The theory and application of pushdown store machines (context) - Evey - 1963
5 Matrix equations and normal forms for context-free grammars (context) - Rosenkrantz - 1967
4 Two iteration theorems for some families of languages (context) - Boasson - 1973
4 the intersection of stacks and queues (context) - Brandenburg - 1983
4 Deterministic pushdown store machines and realtime computati.. (context) - Cole - 1971
3 On jump deterministic pushdown automata (context) - Courcelle - 1977
3 Derivation-bounded languages (context) - Ginsburg, Spanier - 1968
3 A few remarks on the index of context-free grammars and lang.. (context) - Gruska - 1971
3 The equivalence and inclusion problems for NTS languages (context) - S'enizergues - 1985
3 Th'eorie des langages et des automates (context) - Autebert - 1994
2 principal afdl's and polynomial time recognition (context) - Greibach, deterministic - 1973
2 Inclusion relations among families of context-free languages (context) - Yntema - 1967
2 Characterization of rational and algebraic power series (context) - Wechler - 1983
2 Formal power series (context) - Kuich
2 Formale Sprachen (context) - Hotz, Estenfeld - 1981
2 Canonical forms of context-free grammars and position restri.. (context) - Blattner, Ginsburg - 1977
2 The power of the Greibach normal form (context) - Hotz, Kretschmer - 1989
2 Some uniformely erasable families of languages (context) - Ginsburg, Goldstine et al. - 1976
2 Some observations on hardest context-free languages (context) - Autebert, Boasson et al. - 1981
2 A representation theorem for algebraic and context-free powe.. (context) - Shamir - 1967
2 Pushdown automata with terminal languages (context) - Sakarovitch - 1981
2 Context-free grammar forms (context) - Cremers, Ginsburg - 1975
2 Familles de langages translatables et ferm'ees par crochet (context) - Boasson, Crestin et al. - 1973
2 Jump pda's and hierarchies of deterministic cf languages (context) - Greibach - 1974
2 The equivalence problem for realtime dpda's (context) - Oyamaguchi - 1987
2 Transductions de s'eries formelles (context) - Fliess - 1974
1 Church-Rosser controlled rewriting systems and equivalence p.. (context) - S'enizergues - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-igm.univ-mlv.fr/~berstel/Recherche.html): More
Axel Thue's work on repetitions in words - Berstel (1992) (Correct)
List of Symbols - Blackboard Curved Less (Correct)
Context-Free Languages and Push-Down Automata - Autebert, Berstel, Boasson (1997) (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