The following pages link to (Q3046706):
Displaying 16 items.
- On inferring linear single-tree languages (Q294705) (← links)
- Streaming algorithms for language recognition problems (Q391078) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Grammatical inference for even linear languages based on control sets (Q1111403) (← links)
- Learning deterministic even linear languages from positive examples (Q1390943) (← links)
- A descriptive characterisation of even linear languages (Q1430213) (← links)
- Deterministic biautomata and subclasses of deterministic linear languages (Q2278286) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- On linear languages recognized by deterministic biautomata (Q2672654) (← links)
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418) (← links)
- Linear-time suffix parsing for deterministic languages (Q4371678) (← links)
- (Q4864474) (← links)
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear (Q5042255) (← links)
- A grammatical inference for harmonic linear languages (Q5186753) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493035) (← links)
- On the transformation of LL\((k)\)-linear to LL(1)-linear grammars (Q6038708) (← links)