The following pages link to (Q5592246):
Displaying 50 items.
- Finite automata-models for the investigation of dynamical systems (Q287156) (← links)
- When is a pair of matrices mortal? (Q290262) (← links)
- The grammar of mammalian brain capacity (Q290555) (← links)
- The full quotient and its closure property for regular languages (Q293180) (← links)
- Decision problems for word-hyperbolic semigroups (Q306545) (← links)
- An application of Poénaru's ``zipping theory'' (Q307742) (← links)
- Singular propositions, negation and the square of opposition (Q346761) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- Algebraic structures of automata (Q418779) (← links)
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata (Q428877) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- Expected distance between terminal nucleotides of RNA secondary structures (Q455765) (← links)
- Multipass automata and group word problems (Q495997) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Results on the use of category theory for the study of lattice-valued finite state machines (Q508741) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Nondeterministic fuzzy automata with membership values in complete residuated lattices (Q511624) (← links)
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Further remarks on DNA overlap assembly (Q515580) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- Decidability of operation problems for T0L languages and subclasses (Q553300) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Computational complexity of the problem of tree generation under fine-grained access control policies (Q553325) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- On state-alternating context-free grammars (Q557822) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Walks in the quarter plane: Kreweras' algebraic model (Q558684) (← links)
- On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
- A lower bound for probabilistic algorithms for finite state machines (Q579936) (← links)
- Basic tree transducers (Q579951) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- Partition semantics for relations (Q579957) (← links)
- Turing complexity of the ordinals (Q580332) (← links)
- Presentations of inverse monoids (Q582399) (← links)
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines (Q593784) (← links)
- Deletion along trajectories (Q596097) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
