The following pages link to (Q4066625):
Displaying 44 items.
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- The decidability of equivalence for deterministic finite transducers (Q754658) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Reset machines (Q1136756) (← links)
- Automates a file (Q1139945) (← links)
- Some language families generated by one-letter languages (Q1189722) (← links)
- One counter languages and the IRS condition (Q1218284) (← links)
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (Q1220388) (← links)
- Abstract families of length-preserving processors (Q1222025) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Bounded AFLs (Q1227455) (← links)
- Proving containment of bounded AFL (Q1230665) (← links)
- Some uniformly erasable families of languages (Q1232299) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Single-valued a-transducers (Q1242878) (← links)
- On languages specified by relative acceptance (Q1249438) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- Controlled pushdown automata (Q1394126) (← links)
- Semilinearity of families of languages (Q1616975) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Checking automata and one-way stack languages (Q2532393) (← links)
- Scattered context grammars (Q2532394) (← links)
- Properties of syntax directed translations (Q2532395) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- Writing pushdown acceptors (Q2540271) (← links)
- A hierarchy between context-free and context-sensitive languages (Q2544411) (← links)
- Three theorems concerning principal AFLs (Q2546302) (← links)
- Time-bounded grammars and their languages (Q2548174) (← links)
- On AFL generators for finitely encoded AFA (Q2556749) (← links)
- Abstract language design (Q2638790) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- (Q3481689) (← links)
- Varieties of Languages in a Category (Q4635823) (← links)
- A note on undecidable properties of formal languages (Q5538917) (← links)
- The theory of languages (Q5551468) (← links)
- Quasi-realtime languages (Q5582342) (← links)
- Studies in abstract families of languages (Q5590062) (← links)
- The theory of languages (Q5592247) (← links)
- (Q5753524) (← links)
- Abstract families of relations (Q5904504) (← links)
- Abstract families of relations (Q5921426) (← links)
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS (Q6065367) (← links)
