Inference of Reversible Languages
From MaRDI portal
Publication:3945599
DOI10.1145/322326.322334zbMath0485.68066OpenAlexW2092386826WikidataQ59595161 ScholiaQ59595161MaRDI QIDQ3945599
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322326.322334
inductive inferencegrammatical inferenceefficient algorithms for inferring certain subclasses of the regular languages from finite positive samples
Related Items (only showing first 100 items - show all)
One-way reversible multi-head finite automata ⋮ Polynomial-time identification of very simple grammars from positive data. ⋮ The inference of tree languages from finite samples: An algebraic approach ⋮ Inferring uniquely terminating regular languages from positive data ⋮ Reversible top-down syntax analysis ⋮ \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures ⋮ Computing the relative entropy between regular tree languages ⋮ Quotients and atoms of reversible languages ⋮ One-Way Reversible Multi-head Finite Automata ⋮ Real-time reversible iterative arrays ⋮ 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 ⋮ Inductive inference of ultimately periodic sequences ⋮ Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Birecurrent sets ⋮ Generating grammars for SGML tagged texts lacking DTD ⋮ Aspects of Reversibility for Classical Automata ⋮ Reversible Limited Automata ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Recent advances of grammatical inference ⋮ Learning deterministic even linear languages from positive examples ⋮ Grammatical inference: An old and new paradigm ⋮ Learning strongly deterministic even linear languages from positive examples ⋮ Identification of function distinguishable languages. ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ On the size of inverse semigroups given by generators ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Queue Automata: Foundations and Developments ⋮ Learning tree languages from text ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Learning discrete categorial grammars from structures ⋮ Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Minimal Reversible Deterministic Finite Automata ⋮ Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ The grammatical inference problem for the Szilard languages of linear grammars ⋮ Topological Properties of Concept Spaces ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ One-way reversible and quantum finite automata with advice ⋮ A Lower Bound For Reversible Automata ⋮ Distributional learning of parallel multiple context-free grammars ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ Nondeterministic syntactic complexity ⋮ Wrapper induction: Efficiency and expressiveness ⋮ Efficient learning of context-free grammars from positive structural examples ⋮ Theory of reaction automata: a survey ⋮ Identification of Petri nets from knowledge of their language ⋮ Fast reversible language recognition using cellular automata ⋮ Kernel methods for learning languages ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ On varieties of meet automata ⋮ On the structural grammatical inference problem for some classes of context-free grammars ⋮ Automatic learning of subclasses of pattern languages ⋮ Model identification of unobservable behavior of discrete event systems using Petri nets ⋮ Reversible pushdown automata ⋮ Learnability of automatic classes ⋮ Topological properties of concept spaces (full version) ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Learning context-free grammars using tabular representations ⋮ Bideterministic automata and minimal representations of regular languages ⋮ Identification of birfsa languages. ⋮ Learning local transductions is hard ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting ⋮ Reversible pushdown transducers ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data ⋮ An instruction set for reversible Turing machines ⋮ Learning \((k,l)\)-contextual tree languages for information extraction from web pages ⋮ Minimal NFA and biRFSA Languages ⋮ Algorithms for learning regular expressions from positive data ⋮ Transducing reversibly with finite state machines ⋮ Transducing reversibly with finite state machines ⋮ Learning efficiency of very simple grammars from positive data ⋮ Transition graphs of reversible reaction systems ⋮ Automatic Learners with Feedback Queries ⋮ Learning approximately regular languages with reversible languages ⋮ Minimal and Reduced Reversible Automata ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data ⋮ On locally reversible languages ⋮ Necessary and sufficient conditions for learning with correction queries ⋮ Descriptional complexity of regular languages ⋮ Real-Time Reversible One-Way Cellular Automata ⋮ SIMPLE FLAT LANGUAGES: A LEARNABLE CLASS IN THE LIMIT FROM POSITIVE DATA ⋮ SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA ⋮ Inference of deterministic one-counter languages ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ The synthesis of language learners. ⋮ Information symmetries in irreversible processes ⋮ Inferring regular languages by merging nonterminals ⋮ Bideterministic weighted automata
This page was built for publication: Inference of Reversible Languages
