The following pages link to (Q3214824):
Displaying 50 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides (Q332896) (← links)
- The state complexity of random DFAs (Q338393) (← links)
- Polynomial characteristic sets for \(DFA\) identification (Q442107) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- Program verification: state of the art, problems, and results. II (Q466002) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Automata over abstract finite quasigroups (Q681717) (← links)
- Analysis of the structure of attributed transition systems without hidden transitions (Q681892) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- Combinatorial optimization by stochastic automata (Q750309) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← links)
- Infinity problems and countability problems for \(\omega \)-automata (Q845856) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Analyzing the structure of a class of linear automata over a ring \(Z_{p^k}\) (Q946779) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- Finite automata encoding geometric figures (Q995557) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- On the power of recursive optimizers (Q1114401) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- Remark on the star-height-problem (Q1149251) (← links)
- On direct products of automaton decidable theories (Q1168306) (← links)
- Semigroup automaton structure by homomorphism and domain partition (Q1182316) (← links)
- A decidability result for deterministic \(\omega\)-context-free languages (Q1239008) (← links)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- On the inference of strategies (Q1263988) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- On the learnability and usage of acyclic probabilistic finite automata (Q1271548) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- Recent advances of grammatical inference (Q1390941) (← links)
- Automata over continuous time (Q1399970) (← links)
- The size of power automata. (Q1401251) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- How to decide continuity of rational functions on infinite words (Q1589419) (← links)
- Finite variability interpretation of monadic logic of order (Q1606122) (← links)
- Attributed transition systems with hidden transitions (Q1709456) (← links)
- Affine automata and classical fractals (Q1745690) (← links)
- Generalized regular expressions - a language for synthesis of programs with branching in loops (Q1822523) (← links)
- Real functions incrementally computable by finite automata (Q1826628) (← links)
- Limit distributions of certain characteristics of random automaton graphs (Q1846697) (← links)
- Decidability of split equivalence (Q1854504) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Learning algorithms (Q2074213) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Minimal consistent DFA from sample strings (Q2182675) (← links)
