The following pages link to (Q3862379):
Displaying 50 items.
- Graph-theoretic formalization of hybridization in DNA sticker complexes (Q256713) (← links)
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively (Q262426) (← links)
- Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Conjugacy languages in groups (Q273099) (← links)
- On del-robust primitive words (Q277635) (← links)
- The universal fuzzy automaton (Q279373) (← links)
- Weighted restarting automata and pushdown relations (Q287429) (← links)
- Concurrent Kleene algebra with tests and branching automata (Q299205) (← links)
- Labeled cuts in graphs (Q313962) (← links)
- Geodesic growth of right-angled Coxeter groups based on trees (Q314039) (← links)
- Deciding whether a regular language is generated by a splicing system (Q340586) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Ordered multi-stack visibly pushdown automata (Q344793) (← links)
- A possible neural representation of mathematical group structures (Q347051) (← links)
- On the computation of quotients and factors of regular languages (Q351995) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Hyperbolicity of monoids presented by confluent monadic rewriting systems. (Q375928) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- Impartial games emulating one-dimensional cellular automata and undecidability (Q385042) (← links)
- A mechanisation of some context-free language theory in HOL4 (Q386032) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- Bounded repairability of word languages (Q394744) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Fine-tuning the search for microsatellites (Q396641) (← links)
- Fuzzy local \(\omega\)-systems (Q396705) (← links)
- Quasitriangular structure of Myhill-Nerode bialgebras (Q398523) (← links)
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- Retracted: Universal computation is `almost surely' chaotic (Q403026) (← links)
- \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
- Algorithms and topology of Cayley graphs for groups. (Q404175) (← links)
- On sets of numbers accepted by P/T systems composed by join (Q410705) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Language theoretical properties of hairpin formations (Q418760) (← links)
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules (Q442111) (← links)
- Sampling different kinds of acyclic automata using Markov chains (Q442144) (← links)
- A finite state intersection approach to propositional satisfiability (Q442157) (← links)
