The following pages link to (Q5576254):
Displayed 50 items.
- Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- On the open problem of Ginsburg concerning semilinear sets and related problems (Q391304) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Bounded underapproximations (Q453533) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- Multipass automata and group word problems (Q495997) (← links)
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- Decision problems of object histories (Q582039) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Boundedness testing for unambiguous context-free grammars (Q594604) (← links)
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Block insertion and deletion on trajectories (Q627169) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Dynamical properties of PWD0L systems (Q673067) (← links)
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- Context-free grammars, differential operators and formal power series (Q688685) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Intersections de langages algébriques bornes (Q754651) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- Additive structure of totally positive quadratic integers (Q785998) (← links)
- Iterators for sequence expressions (Q794178) (← links)
- Extended automata-like regular expressions of star degree at most (2,1) (Q808718) (← links)
- On bounded interpretations of grammar forms (Q808719) (← links)
- On the growth of linear languages (Q817237) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Representation and uniformization of algebraic transductions (Q855271) (← links)
- Deterministic catalytic systems are not universal (Q860859) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- Extended regular expressions of star degree at most two (Q921911) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Slender Siromoney matrix languages (Q948096) (← links)
- On bounded rational trace languages (Q970110) (← links)
- On the separability of sparse context-free languages and of bounded rational relations (Q995585) (← links)
- Tetris and decidability (Q1029095) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 (Q1054158) (← links)
- Bicentres de langages algébriques (Q1055201) (← links)