A Characterization of Context-free Languages

  title={A Characterization of Context-free Languages},
  author={Jozef Gruska},
  journal={J. Comput. Syst. Sci.},
  • J. Gruska
  • Published 1 August 1971
  • Computer Science, Linguistics
  • J. Comput. Syst. Sci.
Recursive generation of local adjunct languages
  • J. Hart
  • Linguistics
    Mathematical systems theory
  • 2005
It is shown that the local adjunct languages are actually closely related to the regular and context-free languages, despite the entirely different form of definition.
The Axiomatization Problem of a Theory of Linear Languages
This paper presents algebraic characterizations of the class of contextfree lamguages that have the property that the number of necessary operations grows with growing cardinality of the underlying alphabet.
The Algebraic Approach II: Dioids, Quantales and Monads
This work has recast and generalized the Chomsky hierarchy as a complete lattice of dioid algebras and formulates a general construction by ideals that yields a family of adjunctions between the members of this hierarchy.
Abstract Families of Context-Free Grammars
There exist two distinct infinite hierarchies of AFG which exhaust the derivation bounded AFG and are shown to be strongly incomparable to the other; that is, the first member of each generates some language not generated by a fixed but arbitrary member of the other.
Algebraic Systems and Pushdown Automata
This chapter focuses on the core aspects of algebraic series, pushdown automata, and their relation to formal languages, and a presentation of their theory based on the concept of properness.
Substitution Expressions
A Note on the Equivalence and Complexity of Linear Grammars
  • J. Sempere
  • Computer Science, Mathematics
  • 2003
This paper considers some equivalence properties of linear expressions in order to obtain a characterization of reversal and Kolmogorov complexity of linear languages and obtains a speed-up theorem for reversal complexity.
Characterizations of regular and context-free matrices
It is shown that the family of regular matrix languages is a principal abstract family of matrices (AFM) and the effect of string control and array control on these families are examined.
On Context-Free Languages of Scattered Words
The first part of the paper proves that an MCFL of scattered words is a BCFL iff the rank of every word in the language is bounded by an integer depending only on the language.
Formal Tree Series
This survey reports on generalizations of some results on formal tree languages, tree grammars and tree automata achieved by an algebraic treatment using semirings, fixed point theory, formal tree series and matrices that are very satisfactory from a mathematical point of view.


Regular-Like Expressions for Some Irregular Languages
It is shown that a set of regular expressions can be used to characterize every language which is generated by a non-expansive context-free grammar, i.e. which is a standard matching-choice set as defined by Yntema.
Derivation-Bounded Languages
Finite-Turn Pushdown Automata
A study of these finite-turn pda and the context free languages they recognize and their characterized both in terms of grammars and generation from finite sets by three operations.
On a classification of context-free languages
The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­
BRZOZOWSKI, "Regular-Like Expressions for Some Irregular Languages," IEEE Conference record
  • Ninth Annual Symposium on Switching and Automata Theory, pp
  • 1968
St'ANIER, Finite-turn pushdown automata
  • S I A M J. Control
  • 1966
Generalization of Regular Sets,
  • Abstracts of the Mathematics Congress,
  • 1966
BANERJI, Phrase structure languages, finite machines and channel capacity, Information and Control
  • 1963