Pages that link to "Item:Q3167489"
From MaRDI portal
The following pages link to Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489):
Displaying 8 items.
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet (Q2280321) (← links)
- Epsilon-reducible context-free languages and characterizations of indexed languages (Q2280325) (← links)
- Consensus Game Acceptors (Q3451093) (← links)
- Consensus Game Acceptors and Iterated Transductions (Q4640036) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- Limited automata and unary languages (Q5915989) (← links)
- From words to pictures: row-column combinations and Chomsky-Schützenberger theorem (Q6548960) (← links)