The following pages link to (Q4198075):
Displayed 50 items.
- Splicing systems and the Chomsky hierarchy (Q428896) (← links)
- Theoretical and computational properties of transpositions (Q553917) (← links)
- A representation theorem of infinite dimensional algebras and applications to language theory (Q579947) (← links)
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Basic tree transducers (Q579951) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- Groups and NTS languages (Q580992) (← links)
- Decision problems of object histories (Q582039) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- Boundedness testing for unambiguous context-free grammars (Q594604) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
- On stateless deterministic restarting automata (Q611046) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Context-free pairs of groups. II: Cuts, tree sets, and random walks (Q658032) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Context-free recognition via shortest paths computation: a version of Valiant's algorithm (Q673077) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- A unifying approach to picture grammars (Q719247) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- More on the power of chain rules in context-free grammars (Q759487) (← links)
- On regularity of context-free languages (Q759489) (← links)
- A note on intersections of free submonoids of a free monoid (Q760507) (← links)
- An infinite square-free co-CFL (Q761044) (← links)
- Nivat's processing systems: decision problems related to protection and synchronization (Q761796) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- An algebraic characterization of some principal regulated rational cones (Q786546) (← links)
- It is decidable whether a regular language is pure context-free (Q787679) (← links)
- On DOS languages and DOS mappings (Q791326) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Context-free complexity of finite languages (Q792097) (← links)
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- Groups, the theory of ends, and context-free languages (Q792454) (← links)
- On some variants of Post's correspondence problem (Q792770) (← links)
- On context-free and Szilard languages (Q794440) (← links)
- Inference of deterministic one-counter languages (Q794442) (← links)
- On the complexity of LL(k) testing (Q794445) (← links)
- On inherently ambiguous E0L languages (Q796996) (← links)
- Linear indexed languages (Q797293) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Complexity of normal form grammars (Q799380) (← links)
- Commutative one-counter languages are regular (Q800097) (← links)