scientific article; zbMATH DE number 1142312
From MaRDI portal
Publication:4385528
zbMath0900.68286MaRDI QIDQ4385528
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, Exploiting symmetries in mathematical programming via orbital independence, On regular realizability problems for context-free languages, On the equivalence of linear conjunctive grammars and trellis automata, On the rational subsets of the free group, Comparisons of Parikh's condition to other conditions for context-free languages, Ambiguity in omega context free languages, Church-Rosser codes, Context-free pairs of groups. I: Context-free pairs and graphs, Grammar semantics, analysis and parsing by abstract interpretation, Bijective sequential mappings of a free monoid onto another, Shortest path algorithms for functional environments, Infinite hypergraphs. II: Systems of recursive equations, The failure of the strong pumping lemma for multiple context-free languages, Group presentations, formal languages and characterizations of one- counter groups, A polynomial algorithm testing partial confluence of basic semi-Thue systems, Epsilon-reducible context-free languages and characterizations of indexed languages, Wadge hierarchy of omega context-free languages, Representing recursively enumerable languages by iterated deletion, Complete formal systems for equivalence problems, Regular Realizability Problems and Context-Free Languages, \(L(A)=L(B)\)? decidability results from complete formal systems
