The following pages link to Inference of Reversible Languages (Q3945599):
Displaying 50 items.
- Inferring uniquely terminating regular languages from positive data (Q287033) (← links)
- Computing the relative entropy between regular tree languages (Q293468) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides (Q332896) (← links)
- A model of language learning with semantics and meaning-preserving corrections (Q343904) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- On the size of inverse semigroups given by generators (Q627176) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Inference of deterministic one-counter languages (Q794442) (← links)
- Reversible top-down syntax analysis (Q832945) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- The grammatical inference problem for the Szilard languages of linear grammars (Q917317) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Fast reversible language recognition using cellular automata (Q948083) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- On varieties of meet automata (Q955003) (← links)
- Topological properties of concept spaces (full version) (Q963060) (← links)
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages (Q1009259) (← links)
- Algorithms for learning regular expressions from positive data (Q1013092) (← links)
- Learning efficiency of very simple grammars from positive data (Q1017659) (← links)
- On locally reversible languages (Q1034616) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- Inductive inference of ultimately periodic sequences (Q1110346) (← links)
- Efficient learning of context-free grammars from positive structural examples (Q1186808) (← links)
- On the structural grammatical inference problem for some classes of context-free grammars (Q1198013) (← links)
- Learning approximately regular languages with reversible languages (Q1269920) (← links)
- The inference of tree languages from finite samples: An algebraic approach (Q1329735) (← links)
- Generating grammars for SGML tagged texts lacking DTD (Q1381728) (← links)
- Recent advances of grammatical inference (Q1390941) (← links)
- Learning deterministic even linear languages from positive examples (Q1390943) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- Reversible pushdown automata (Q1757838) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Polynomial-time identification of very simple grammars from positive data. (Q1874233) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Wrapper induction: Efficiency and expressiveness (Q1978784) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- Model identification of unobservable behavior of discrete event systems using Petri nets (Q1999265) (← links)
- An instruction set for reversible Turing machines (Q2041688) (← links)
