The following pages link to (Q5592246):
Displaying 50 items.
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Algebraic Myhill-Nerode theorems (Q620959) (← links)
- Optimal grids for five-axis machining (Q622196) (← links)
- Block insertion and deletion on trajectories (Q627169) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- Finite automata theory with membership values in lattices (Q632699) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Quasi-rocking real-time pushdown automata (Q650904) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- A shrinking lemma for indexed languages (Q671370) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- The element distinctness problem on one-tape Turing machines (Q671603) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Time lower bounds do not exist for CRCW PRAMs (Q672150) (← links)
- Computing with infinitary logic (Q672337) (← links)
- Extremal solutions of inequations over lattices with applications to supervisory control (Q672379) (← links)
- Quasi-deterministic 0L systems and their representation (Q672456) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- A remark on a paper by A.B. Matos (Q673790) (← links)
- Universal computation and other capabilities of hybrid and continuous dynamical systems (Q673870) (← links)
- An algebraic approach to hybrid systems (Q673873) (← links)
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- Interactive proof systems and alternating time-space complexity (Q685437) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Decision problems and regular chain code picture languages (Q686522) (← links)
- Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements (Q690483) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- A coalgebraic approach to Kleene algebra with tests (Q703519) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Program equilibrium (Q705874) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- Composing model programs for analysis (Q710670) (← links)
- Nondeterministic fuzzy automata (Q712503) (← links)
- One-reversal counter machines and multihead automata: revisited (Q714812) (← links)
- Accepting networks of genetic processors are computationally complete (Q714860) (← links)
