Pages that link to "Item:Q5590062"
From MaRDI portal
The following pages link to Studies in abstract families of languages (Q5590062):
Displayed 50 items.
- The string merging problem (Q1154285) (← links)
- Bounded query machines: on NP( ) and NPQUERY( ) (Q1158752) (← links)
- On nonstochastic languages and homomorphic images of stochastic languages (Q1163382) (← links)
- On a language without star (Q1172399) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- Complexity in left-associative grammar (Q1202927) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- On incomparable abstract family of languages (AFL) (Q1210909) (← links)
- Automatic correction of syntax-errors in programming languages (Q1211841) (← links)
- Two iteration theorems for some families of languages (Q1214758) (← links)
- Transductions de séries formelles (Q1215689) (← links)
- Two-way A-transducers and AFL (Q1216181) (← links)
- The decidability of a mapping problem for generalized sequential machines with final states (Q1216390) (← links)
- Sur une conjecture de S. Greibach (Q1216963) (← links)
- Some independent families of one-letter languages (Q1217463) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- The tape-complexity of context-independent developmental languages (Q1220791) (← links)
- Some properties of the class of \(L\) languages with interactions (Q1222512) (← links)
- Context-free grammar forms (Q1226865) (← links)
- Bounded AFLs (Q1227455) (← links)
- Max-product grammars and languages (Q1229591) (← links)
- Characterization theorems on abstract families of transducers (Q1230515) (← links)
- Hypergrammars: An extension of macrogrammars (Q1234592) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Produit dans le cône rationnel engendre par D (Q1242699) (← links)
- Single-valued a-transducers (Q1242878) (← links)
- A note on classes of complements and the LBA-problem (Q1243140) (← links)
- On two-way sequential transductions of full semi-AFL's (Q1249942) (← links)
- Opérations de cylindre et applications séquentielles gauches inverses (Q1250714) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- Générateurs algébriques et systèmes de paires iterantes (Q1258610) (← links)
- On two families of forests (Q1323385) (← links)
- Families of automata characterizing context-sensitive languages (Q1772107) (← links)
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets (Q1836994) (← links)
- Left-derivation bounded languages (Q1843308) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Algebraic aspects of families of fuzzy languages (Q1870578) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Weighted automata with storage (Q2280328) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies (Q2353402) (← links)
- What makes some language theory problems undecidable (Q2540268) (← links)
- Principal AFL (Q2540269) (← links)
- On the existence of generators for certain AFL (Q2541640) (← links)
- Time- and tape-bounded Turing acceptors and AFLs (Q2542726) (← links)
- Substitution in families of languages (Q2544191) (← links)
- Abstract families of processors (Q2546020) (← links)
- A characterization of two-way deterministic classes of languages (Q2547802) (← links)