Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Other algebras related to logic (03G25) Ordered structures (06F99) Natural language processing (68T50)
Recommendations
Cites work
- scientific article; zbMATH DE number 1341534 (Why is no real title available?)
- scientific article; zbMATH DE number 1953885 (Why is no real title available?)
- scientific article; zbMATH DE number 1786547 (Why is no real title available?)
- Commutation-augmented pregroup grammars and mildly context-sensitive languages
- Complexity of Makanin's algorithm
- DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
- EQUATIONS IN A FREE GROUP
Cited in
(4)
This page was built for publication: Extending free pregroups with lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993496)