The following pages link to (Q5592246):
Displaying 27 items.
- Nondeterministic fuzzy automata with membership values in complete residuated lattices (Q511624) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Finite automata theory with membership values in lattices (Q632699) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- Computable queries for relational data bases (Q1151060) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- A framework to visualize equivalences between computational models of regular languages. (Q1853108) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Exact enumeration of acyclic deterministic automata (Q2489949) (← links)
- The relationships among several types of fuzzy automata (Q2499061) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Algebraic properties of \(LA\)-languages (Q2509236) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
