On languages generated by signed grammars
From MaRDI portal
Cites work
- A note on the complement of inherently ambiguous context-free languages
- Ambiguity in context free languages
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- Analytic models and ambiguity of context-free languages
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- Classifying invariant structures of step traces
- Combinatorial problems of commutation and rearrangements
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3436630 (Why is no real title available?)
- scientific article; zbMATH DE number 1501609 (Why is no real title available?)
- scientific article; zbMATH DE number 1759455 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- Invariant structures and dependence relations
- Languages generated by context-free grammars extended by type \(AB\to BA\) rules
- Lessons in enumerative combinatorics
- Linear automata with translucent letters and linear context-free trace languages
- New analytic techniques for proving the inherent ambiguity of context-free languages
- Non-closure under complementation for unambiguous linear grammars
- Shuffle on trajectories: Syntactic constraints
- Sublogarithmic ambiguity
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
- Trajectories and Traces on Non-traditional Regular Tessellations of the Plane
This page was built for publication: On languages generated by signed grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940573)
