The following pages link to (Q5592246):
Displaying 50 items.
- On size reduction techniques for multitape automata (Q860868) (← links)
- Iterated sequential transducers as language generating devices (Q861252) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- View-based query processing: on the relationship between rewriting, answering and losslessness (Q870266) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- Context-dependent nondeterminism for pushdown automata (Q880177) (← links)
- An equational logic based approach to the security problem against inference attacks on object-oriented databases (Q881598) (← links)
- P systems with minimal parallelism (Q884455) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Complexity and decidability for restricted classes of picture languages (Q909482) (← links)
- Picture iteration and picture ambiguity (Q909483) (← links)
- A note on ambiguity in context-free grammars (Q911784) (← links)
- On attribute grammars without attribute synthesis (Q911787) (← links)
- A theory of compaction-based parallelization (Q914354) (← links)
- Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability) (Q914396) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- Complexity-theoretic algebra. II: Boolean algebras (Q915723) (← links)
- Distribution and synchronized automata (Q917329) (← links)
- Efficient expansion of factored expressions (Q918712) (← links)
- Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
- Bi-immunity results for cheatable sets (Q920981) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Decision problems in membrane systems with peripheral proteins, transport and evolution (Q953538) (← links)
- (Mem)brane automata (Q953539) (← links)
- Bounded sequence testing from deterministic finite state machines (Q964395) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- Bounded regular path queries in view-based data integration (Q989472) (← links)
- Detecting patterns in finite regular and context-free languages (Q990125) (← links)
- Topological and measure-theoretic properties of one-dimensional cellular automata (Q992262) (← links)
- Quasilinear cellular automata (Q992263) (← links)
- Computational mechanics of cellular automata: an example (Q992271) (← links)
- Pushdown dimension (Q995564) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Fault-tolerant computation of distributed regular path queries (Q1001900) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- Malcev presentations for subsemigroups of direct products of coherent groups. (Q1008745) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- Primitivity of finitely presented monomial algebras. (Q1013104) (← links)
- The 4-way deterministic tiling problem is undecidable (Q1013128) (← links)
