Solutions of equations in languages
- 213 Downloads
A context-free grammar corresponds to a system of equations in languages. The language generated by the grammar is the smallest solution of the system. We give a necessary and sufficient condition for an arbitrary solution to be the smallest one. We revive an old criterion to decide that a grammar has a unique solution. All this fits in an approach to search for a grammar for an arbitrary language that is given by other means. The approach is illustrated by the derivation of a grammar for a certain set of bit strings. The approach is used to give an elegant derivation of the grammar for a language accepted by a pushdown automaton.
KeywordsLanguage Grammar Context-free Pushdown automaton Unguarded recursion
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution,and reproduction in any medium, provided the original author(s) and source are credited.
- Cho62.Chomsky N (1962) Context-free grammar and pushdown storage. Quarterly Progress Report, MIT Research Lab. in Electronics 65: 187–194Google Scholar
- Kup97.Kupka I (1997) Unique fixpoints in complete lattices with applications to formal languages and semantics. In: Freksa C, Jantzen M, Valk R (eds) Foundations of Computer Science: potential-theory-cognition, vol 1337 of LNCS. Springer, New York, pp 107–115Google Scholar
- Sud06.Sudkamp TA (2006) Languages and machines, 3rd edn. Pearson, BostonGoogle Scholar