Linear Automaton Transformations
From MaRDI portal
Publication:3264483
DOI10.2307/2033204zbMath0089.33403OpenAlexW4244661353MaRDI QIDQ3264483
Publication date: 1958
Full work available at URL: https://doi.org/10.2307/2033204
Related Items
Auxiliary functions and constructive specification of general systems, Mathematical systems theory: Causality, Records of turing machines, On nondeterministic-causal time systems, Active model learning of stochastic reactive systems, Relativized adjacency, Learning with limited memory: Bayesianism vs heuristics, Forgetful updating and stubborn decision-makers, Active automata learning as black-box search and lazy partition refinement, Towards a grand unification of Büchi complementation constructions, Inferring Symbolic Automata, Minimization of automata for liveness languages, Learning and characterizing fully-ordered lattice automata, Compatibility of refining and controlling plant automata with bisimulation quotients, New characterizations of primitive permutation groups with applications to synchronizing automata, Realization is universal, Recognizability in residuated lattices, Duality of Lattices Associated to Left and Right Quotients, Minimization of Finite State Automata Through Partition Aggregation, Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited, A Myhill-Nerode theorem for register automata and symbolic trace languages, Minimizing Deterministic Lattice Automata, T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures, Asynchronous automata versus asynchronous cellular automata, An approach to deciding the observational equivalence of Algol-like languages, Deciding top-down determinism of regular tree languages, The state complexity of \(L^{2}\) and \(L^k\), Computing equilibria: a computational complexity perspective, Certifying DFA bounds for recognition and separation, Computable execution traces, Two Observations in Dioid Based Model Refinement, Inferring regular languages and \(\omega\)-languages, Manipulation of regular expressions using derivatives: an overview, La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time), Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees, Unnamed Item, A geometrical view of the determinization and minimization of finite-state automata, Building efficient and compact data structures for simplicial complexes, Growth rates of permutation classes: categorization up to the uncountability threshold, On projective and separable properties, Alternation Hierarchies of First Order Logic with Regular Predicates, From regular expressions to DFA's using compressed NFA's, A hierarchy of deterministic languages, The genus of regular languages, Average case analysis of Moore's state minimization algorithm, Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz, Execution trace sets for real computation, Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages, Geometrical regular languages and linear Diophantine equations: the strongly connected case, Unnamed Item, Quadratic automata, Unnamed Item, A succinct canonical register automaton model, Learning register automata: from languages to program structures, Certifying inexpressibility, Generalized cancellation-and-permutation properties, regular languages and supports of rational series, Cycle-aware minimization of acyclic deterministic finite-state automata, Partial derivatives of regular expressions and finite automaton constructions, \(L^\ast\)-based learning of Markov decision processes (extended version), Yes, the “missing axiom” of matroid theory is lost forever, Pseudo dynamic hybrid systems, A generalization of Myhill-Nerode theorem for fuzzy languages, Unnamed Item, The inclusion problem for regular expressions, Myhill-Nerode type theory for fuzzy languages and automata, Minimal realization of machines in closed categories, One counter languages and the IRS condition, Cut sets as recognizable tree languages, Algebraic realization theory of bilinear discrete-time input-output maps, Unnamed Item, Unnamed Item, Unnamed Item, La reconnaissance des facteurs d'un mot dans un texte, Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L), Infinitude of Primes Using Formal Languages, Syntactic complexity of regular ideals, Inverse subsemigroups of finite index in finitely generated inverse semigroups, Regular subsets in semi-direct products of monoids, Foundations of system theory: Multidecomposable systems, One way finite visit automata, Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages, Geometrical Regular Languages and Linear Diophantine Equations, On minimal realization of fuzzy behaviour and associated categories, Aggregation-based minimization of finite state automata, Unnamed Item, A categorical approach to minimal realization for a fuzzy language, Prime languages, Regular Geometrical Languages and Tiling the Plane, Sequential fuzzy system identification, Automata Learning with Automated Alphabet Abstraction Refinement, An Efficient Algorithm for the Construction of the Equation Tree Automaton, Automata theory and control theory - a rapprochement, Fast equation automaton computation, Compact Normal Form for Regular Languages as Xor Automata, Recognizability in the Simply Typed Lambda-Calculus, Time-varying linear sequential machines. I, The state of dynamical input-output systems as an operator, A beam search algorithm for PFSA inference, On the relevance of abstract algebra to control theory, Minimizing GFG Transition-Based Automata, Syntactic operators on full semiAFLs, AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL, On regularity of context-free languages, Generic results for concatenation hierarchies, Unnamed Item, Natural states and past-determinism of general time systems, Average complexity of Moore's and Hopcroft's algorithms, Finding regular insertion encodings for permutation classes, New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries, Robust Stability of Input-Output Systems with Initial Conditions, Some Remarks on Abstract Machines, Hybrid discrete-continuous systems with control. II: State space method, A linear time solution to the single function coarsest partition problem, The smallest automaton recognizing the subwords of a text, Learning residual alternating automata, Myhill-Nerode Methods for Hypergraphs, Strict sets and finite semigroup coverings, Doubly-Periodic Sequences and Two-Dimensional Recurrences, Yet another canonical nondeterministic automaton, Construction of a minimal realization and monoid for a fuzzy language: a categorical approach, Computation theory of cellular automata, Some restrictions onW-grammars
