scientific article; zbMATH DE number 1142312
From MaRDI portal
Publication:4385528
zbMATH Open0900.68286MaRDI QIDQ4385528FDOQ4385528
Authors: Jean Berstel, Luc Boasson 
Publication date: 14 May 1998
Title of this publication is not available (Why is that?)
Cited In (22)
- Infinite hypergraphs. II: Systems of recursive equations
- Exploiting symmetries in mathematical programming via orbital independence
- On the rational subsets of the free group
- Context-free pairs of groups. I: Context-free pairs and graphs
- On the equivalence of linear conjunctive grammars and trellis automata
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Shortest path algorithms for functional environments
- Group presentations, formal languages and characterizations of one- counter groups
- Regular Realizability Problems and Context-Free Languages
- Comparisons of Parikh's condition to other conditions for context-free languages
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Representing recursively enumerable languages by iterated deletion
- The failure of the strong pumping lemma for multiple context-free languages
- Complete formal systems for equivalence problems
- On regular realizability problems for context-free languages
- Automata with two-sided pushdowns defined over free groups generated by reduced alphabets
- Bijective sequential mappings of a free monoid onto another
- Grammar semantics, analysis and parsing by abstract interpretation
- Wadge hierarchy of omega context-free languages
- Epsilon-reducible context-free languages and characterizations of indexed languages
- Ambiguity in omega context free languages
- Church-Rosser codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385528)
