Henning Fernau  Home/Search
Context
Related
| ira.uka.de/pub/unikarl...199422.ps.gz fs.informatik.unituebinge...199422.ps fs.informatik.unituebingen.de...glf.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: fermivista.math....ftp.ira.uka.de (more) From: fs.informatik.unituebingen.de... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : In this report, we emphasize the differences of grammar families and their properties versus language families and their properties. To this end, we investigate grammar families from an abstract standpoint, developping a new framework of reasoning. In particular when considering decidability questions, special care must be taken when trying to use decidability results (which are, in the first place, properties of grammar families) in order to establish results (e.g. hierarchy results) on... (Update)
Active bibliography (related documents): More All
0.7: Accepting Grammars and Systems - Bordihn, Fernau (1995) (Correct)
0.5: Regulated Finite Index Language Families Collapse - Fernau, Holzer (1996) (Correct)
0.2: Programmierte Grammatiken mit unbedingtem Übergang und verwandte.. - Fernau (1996) (Correct)
Similar documents based on text: More All
0.7: Valuations and Unambiguity of Languages, with Applications to .. - Fernau, Staiger (Correct)
0.3: Membership for Limited ET0L Languages Is Not Decidable - Fernau (1994) (Correct)
0.3: Dynamic Coupling of Binary Components and its Technical Support - Heuzeroth, Reussner (1999) (Correct)
BibTeX entry: (Update)
@techreport{ fernau94observations,
author = "H. Fernau",
title = "Observations on Grammar and Language Families",
number = "22/94",
year = "1994",
url = "citeseer.ist.psu.edu/fernau93observations.html" }
Citations (may not include all citations):1911 Introduction to automata theory (context) - Hopcroft, Ullman - 1979
220 Formal Languages (context) - Salomaa - 1973
170 Nondeterministic space is closed under complementation - Immerman - 1988
120 Regulated Rewriting in Formal Language Theory (context) - Dassow, Paun - 1989
42 The method of forced enumeration for nondeterministic automa.. (context) - Szelepcs'enyi - 1988
29 The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1988
20 volume 125 of Studies in Logic and Foundations of Mathematic.. (context) - Odifreddi, Theory - 1989
20 Programmed grammars and classes of formal languages (context) - Rosenkrantz - 1969
12 An undecidability result for regular languages and its appli.. (context) - Hinz, Dassow - 1989
8 On function-limited Lindenmayer systems (context) - Fernau - 1991
2 To appear in Fundamenta Informaticae (context) - Fernau, language
2 nye grammatiki i ograniqeniĜ na vyvod (context) - Stotskii - 1971
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ira.uka.de.html): More
Feasible Models of Computation: Three-Dimensionality and .. - Sanders, Vollmar, Worsch (1997) (Correct)
Tableaux and Witnesses for the µ-Calculus - Kick (1995) (Correct)
Towards Optimal Locality in Mesh-Indexings - Niedermeier, Reinhardt, Sanders (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