The following pages link to (Q5592246):
Displaying 50 items.
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata (Q736618) (← links)
- Introduction to design choices in the semantics of Statecharts (Q750133) (← links)
- Small cancellation theory and automatic groups (Q750615) (← links)
- An undecidable problem about rational sets and contour words of polyominoes (Q751298) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- Formulas for calculating supremal controllable and normal sublanguages (Q752649) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- On Horn spectra (Q757356) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- A note on alternating on-line Turing machines (Q789181) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Groups, the theory of ends, and context-free languages (Q792454) (← links)
- An application of array grammars to clustering analysis for syntactic patterns (Q792772) (← links)
- Two-dimensional alternative Turing machines (Q794169) (← links)
- Data structures for distributed counting (Q794431) (← links)
- Homomorphic images of sentential form languages defined by semi-Thue systems (Q795513) (← links)
- Towards a programming language based on the notion of two-level grammar (Q795514) (← links)
- The complexity of monadic recursion schemes: Exponential time bounds (Q796301) (← links)
- A tradeoff theorem for space and reversal (Q797282) (← links)
- Linear indexed languages (Q797293) (← links)
- Semi-linearity, Parikh-boundedness and tree adjunct languages (Q799121) (← links)
- Stability in L systems (Q802316) (← links)
- Minimal strings in a regular language with respect to a partial order on the alphabet (Q807021) (← links)
- Formal languages and global cellular automaton behavior (Q807036) (← links)
- Wolfram's class IV automata and a good Life (Q807049) (← links)
- The complexity of matrix transposition on one-tape off-line Turing machines (Q808247) (← links)
- On the connectedness of pictures in chain code picture languages (Q808270) (← links)
- Extended automata-like regular expressions of star degree at most (2,1) (Q808718) (← links)
- On bounded interpretations of grammar forms (Q808719) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids (Q812560) (← links)
- Building reduced Petri net models of discrete manufacturing systems (Q814230) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- Decidability of SHIQ with complex role inclusion axioms (Q814639) (← links)
- On the growth of linear languages (Q817237) (← links)
- Pattern expressions and pattern automata (Q834961) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Regulated nondeterminism in pushdown automata (Q840763) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- Notions of hyperbolicity in monoids. (Q846368) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- A genetic system based on simulated crossover of sequences of two-bit genes (Q857396) (← links)
