The following pages link to Control sets on grammars (Q5539750):
Displayed 38 items.
- Basic tree transducers (Q579951) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Linear indexed languages (Q797293) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- Grammars, derivation modes and properties of indexed and type-0 languages (Q1098316) (← links)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- Grammatical inference for even linear languages based on control sets (Q1111403) (← links)
- Two-way A-transducers and AFL (Q1216181) (← links)
- Interactive languages (Q1224871) (← links)
- Uniformly erasable AFL (Q1225462) (← links)
- Characterization theorems on abstract families of transducers (Q1230515) (← links)
- Degree-languages: A new concept of acceptance (Q1236888) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
- One way finite visit automata (Q1242687) (← links)
- Fast recognition of context-sensitive structures (Q1258181) (← links)
- Normal forms for context-sensitive grammars (Q1845477) (← links)
- Theory of formal grammars (Q1846334) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- Storage products and linear control of derivations (Q2480751) (← links)
- Derivation-bounded languages (Q2533505) (← links)
- A hierarchy between context-free and context-sensitive languages (Q2544411) (← links)
- Abstract families of processors (Q2546020) (← links)
- General formulation of formal grammars (Q2550633) (← links)
- AFL with the semilinear property (Q2552027) (← links)
- Some concepts for languages more powerful than context-free (Q2560720) (← links)
- DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS (Q3401481) (← links)
- HYBRID EXTENDED FINITE AUTOMATA (Q3503090) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- Notes on canonical label languages (Q3862446) (← links)
- Some formal results about stratificational grammars and their relevance to linguistics (Q3968471) (← links)
- A generalization of leftmost derivations (Q4133156) (← links)
- Size, index, and context-sensitivity of controlled partition grammars (Q4139706) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- Control sets on grammars using depth-first derivations (Q4198079) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
- Accepting grammars with regulation (Q4844589) (← links)
- Images of AFL under certain families of homomorphisms (Q5627632) (← links)