k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
Denis BéchetAnnie ForetPublished in: LACL (2005)
Keyphrases
- random variables
- product form
- steady state
- grammatical inference
- queueing networks
- mildly context sensitive
- stationary distribution
- context free grammars
- context free
- grammar induction
- state dependent
- queuing network
- context free languages
- markov chain
- service times
- queue length
- expressive power
- closure properties
- finite state automata
- natural language
- single server