Induction in formal languages. Some properties of reducing transformations and of isolable sets. (English) Zbl 0135.25201

Full Text: DOI EuDML


[1] D. G. Cantor: On the Ambiguity Problem of Backus Systems. J. Assoc. Comp. Mach. 9 (1962), 477-479. · Zbl 0114.33003 · doi:10.1145/321138.321145
[2] Noam Chomsky, M. P. Schützenberger: The Algebraic Theory of Contex-free Languages. Computer Programming and Formal Systems. (ed. by P. Braffort and D. Hirschberg), Amsterdam 1963.
[3] Václav Fabian: Structural Unambiguity of Formal Languages. Czechoslovak Math. J. 14 (89) (1964), 394-430 · Zbl 0278.68062
[4] Sheita A. Greibach: The Undecidability of the Ambiguity Problem for Minimal Linear Grammars. Information and Control 6 (1963) 119-125. · Zbl 0115.37007 · doi:10.1016/S0019-9958(63)90149-9
[5] Jozef Gruska: On Structural Unambiguity of Formal Languages. Czechoslovak Math. J. 15 (90) (1965), 283-294. · Zbl 0133.25503
[6] J. Gruska: Isolable and Weakly Isolable Sets. · Zbl 0143.25604
[7] J. Gruska: Structural Unambiguity of ALGOL-MOD. · Zbl 0139.00802
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.