Inference of Reversible Languages
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Learning \((k,l)\)-contextual tree languages for information extraction from web pages
- Algorithms for learning regular expressions from positive data
- Learning efficiency of very simple grammars from positive data
- On locally reversible languages
- Necessary and sufficient conditions for learning with correction queries
- Inductive inference of ultimately periodic sequences
- Efficient learning of context-free grammars from positive structural examples
- On the structural grammatical inference problem for some classes of context-free grammars
- Learning approximately regular languages with reversible languages
- The inference of tree languages from finite samples: An algebraic approach
- Generating grammars for SGML tagged texts lacking DTD
- Recent advances of grammatical inference
- Learning deterministic even linear languages from positive examples
- Identification of function distinguishable languages.
- Reversible pushdown automata
- Learnability of automatic classes
- Learning local transductions is hard
- Even linear simple matrix languages: formal language properties and grammatical inference.
- The synthesis of language learners.
- Polynomial-time identification of very simple grammars from positive data.
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Wrapper induction: Efficiency and expressiveness
- Theory of reaction automata: a survey
- Model identification of unobservable behavior of discrete event systems using Petri nets
- An instruction set for reversible Turing machines
- Transition graphs of reversible reaction systems
- Descriptional complexity of regular languages
- Quotients and atoms of reversible languages
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Nondeterministic syntactic complexity
- One-way reversible multi-head finite automata
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Identification of Petri nets from knowledge of their language
- Learning context-free grammars using tabular representations
- Identification of birfsa languages.
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- Automatic learners with feedback queries
- A lower bound for reversible automata
- Simple recurrent networks learn context-free and context-sensitive languages by counting.
- Minimal and Reduced Reversible Automata
- Inferring uniquely terminating regular languages from positive data
- Computing the relative entropy between regular tree languages
- Aspects of reversibility for classical automata
- Reversible limited automata
- Reversible and irreversible computations of deterministic finite-state devices
- Automatic Learners with Feedback Queries
- Inductive inference and reverse mathematics
- Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides
- A model of language learning with semantics and meaning-preserving corrections
- One-way reversible multi-head finite automata
- Learning tree languages from text
- Learning discrete categorial grammars from structures
- Learning Efficiency of Very Simple Grammars from Positive Data
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- Learning Left-to-Right and Right-to-Left Iterative Languages
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- A Note on the Relationship between Different Types of Correction Queries
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Topological Properties of Concept Spaces
- Minimal NFA and biRFSA Languages
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- Inferring regular languages by merging nonterminals
- Birecurrent sets
- Minimal reversible deterministic finite automata
- Distributional learning of parallel multiple context-free grammars
- Reversible languages having finitely many reduced automata
- scientific article; zbMATH DE number 7444007 (Why is no real title available?)
- The computing power of determinism and reversibility in chemical reaction automata
- Queue Automata: Foundations and Developments
- Learning concepts and their unions from positive data with refinement operators
- Simple flat languages: a learnable class in the limit from positive data
- Some sufficient conditions of learnability in the limit from positive data
- Information symmetries in irreversible processes
- Real-time reversible one-way cellular automata
- Reversible pushdown transducers
- Transducing reversibly with finite state machines
- Transducing reversibly with finite state machines
- Grammatical inference: An old and new paradigm
- Learning strongly deterministic even linear languages from positive examples
- Bideterministic weighted automata
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
- Weakly and Strongly Irreversible Regular Languages
- Learning picture sets from examples
- Learning quantum finite automata with queries
- Reversible Top-Down Syntax Analysis
- Bideterministic weighted automata
- Reversible computations of one-way counter automata
- The pumping lemma for regular languages is hard
- Reversible Two-Party Computations
- On the size of inverse semigroups given by generators
- Decision problems for reversible and permutation automata
- Sweeping permutation automata
- The pumping lemma for regular languages is hard
- A hierarchy of reversible finite automata
- Automatic learning of subclasses of pattern languages
- Ordered context-free grammars revisited
- Bideterministic automata and minimal representations of regular languages
- On families of categorial grammars of bounded value, their learnability and related complexity questions
This page was built for publication: Inference of Reversible Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945599)
