The following pages link to Erasable context-free languages (Q4079078):
Displaying 16 items.
- A representation theorem of infinite dimensional algebras and applications to language theory (Q579947) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- On the intersection of the class of linear context-free languages and the class of single-reset languages (Q1094883) (← links)
- Langages satures et cônes decroissants. Langages et cônes bifideles (Q1168750) (← links)
- One counter languages and the IRS condition (Q1218284) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Some uniformly erasable families of languages (Q1232299) (← links)
- One-way simple multihead finite automata (Q1258608) (← links)
- SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES (Q3086246) (← links)
- FORGETTING AUTOMATA AND UNARY LANGUAGES (Q3503096) (← links)
- Single-tape reset machines (Q3709914) (← links)
- (Q3883536) (← links)
- (Q3951572) (← links)
- (Q4131691) (← links)
