Pages that link to "Item:Q5590062"
From MaRDI portal
The following pages link to Studies in abstract families of languages (Q5590062):
Displayed 31 items.
- Finite-turn checking automata (Q2550634) (← links)
- Substitution and bounded languages (Q2550965) (← links)
- Writing stack acceptors (Q2554233) (← links)
- Absolutely parallel grammars and two-way finite-state transducers (Q2555753) (← links)
- (Q3386623) (← links)
- Extensional Uniformity for Boolean Circuits (Q3540171) (← links)
- On the usefulness of bifaithful rational cones (Q3741081) (← links)
- (Q3856117) (← links)
- (Q3873564) (← links)
- (Q3920666) (← links)
- Extension of tabled 0L-systems and languages (Q4045673) (← links)
- Non-prinicipalité du cylindre des langages à compteur (Q4121409) (← links)
- (Q4125809) (← links)
- Comparing language operations (Q4146261) (← links)
- (Q4168079) (← links)
- (Q4168082) (← links)
- (Q4168085) (← links)
- (Q4191620) (← links)
- (Q4742318) (← links)
- Abstract Families of Abstract Categorial Languages (Q4917989) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
- On growing context-sensitive languages (Q5204308) (← links)
- Control sets on grammars (Q5539750) (← links)
- Chains of full AFL's (Q5603191) (← links)
- Images of AFL under certain families of homomorphisms (Q5627632) (← links)
- Multi-stack-counter languages (Q5637896) (← links)
- On the structure of context-sensitive grammars (Q5683718) (← links)
- Abstract families of relations (Q5921426) (← links)
- Extended finite automata over groups (Q5929312) (← links)
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS (Q6065367) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)