The following pages link to (Q4344149):
Displaying 50 items.
- A tree distinguishing polynomial (Q106322) (← links)
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Deciding unique decodability of bigram counts via finite automata (Q386046) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Some undecidable properties of SOS specifications (Q511941) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Combinatorial variations on Cantor's diagonal (Q662034) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Primitive and irreducible automata (Q747295) (← links)
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- Unary finite automata vs. arithmetic progressions (Q989556) (← links)
- Counter machines (Q1606993) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Regular language representations in the constructive type theory of Coq (Q1663246) (← links)
- Weak call-by-value lambda calculus as a model of computation in Coq (Q1687735) (← links)
- On the existence of a cherry-picking sequence (Q1694728) (← links)
- On the boundary between decidability and undecidability of asynchronous session subtyping (Q1704600) (← links)
- A framework to visualize equivalences between computational models of regular languages. (Q1853108) (← links)
- Motif statistics. (Q1853502) (← links)
- Automata, Boolean matrices, and ultimate periodicity. (Q1854295) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Process calculi as a tool for studying coordination, contracts and session types (Q1987732) (← links)
- Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
- Automata on finite trees (Q2074209) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- Automata methods in transcendence (Q2197705) (← links)
- Cyclotomic properties of polynomials associated with automatic sequences (Q2197904) (← links)
- Commutative rational term rewriting (Q2232282) (← links)
- Automata and finite model theory (Q2244824) (← links)
- Two collapsing hierarchies of subregularly tree controlled languages (Q2271461) (← links)
- Inference of bounded L systems with polymorphic P systems (Q2299882) (← links)
- Robust biomolecular finite automata (Q2306018) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
- Deciding Kleene algebra terms equivalence in Coq (Q2347910) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Undecidability of asynchronous session subtyping (Q2407107) (← links)
- The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp (Q2571820) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- On the Formalization of Some Results of Context-Free Language Theory (Q2820703) (← links)
- Closures in Binary Partial Algebras (Q2994476) (← links)
- Automatentheorie und Logik (Q3083622) (← links)
- (Q3086936) (← links)
- A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) (Q3088018) (← links)
- A Formalisation of Finite Automata Using Hereditarily Finite Sets (Q3454094) (← links)
