Linear Automaton Transformations
From MaRDI portal
Publication:3264483
DOI10.2307/2033204zbMATH Open0089.33403OpenAlexW4244661353MaRDI QIDQ3264483FDOQ3264483
Authors: Anil Nerode 
Publication date: 1958
Full work available at URL: https://doi.org/10.2307/2033204
Cited In (only showing first 100 items - show all)
- Sequential fuzzy system identification
- Regular subsets in semi-direct products of monoids
- Active model learning of stochastic reactive systems
- Lower bound methods for the size of nondeterministic finite automata revisited
- Certifying inexpressibility
- The state complexity of \(L^{2}\) and \(L^k\)
- Partial derivatives of regular expressions and finite automaton constructions
- Average case analysis of Moore's state minimization algorithm
- From regular expressions to DFA's using compressed NFA's
- Some restrictions onW-grammars
- Natural states and past-determinism of general time systems
- Automata theory and control theory - a rapprochement
- Auxiliary functions and constructive specification of general systems
- 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)
- Minimization of finite state automata through partition aggregation
- Some Remarks on Abstract Machines
- Inverse subsemigroups of finite index in finitely generated inverse semigroups
- Syntactic complexity of regular ideals
- Aggregation-based minimization of finite state automata
- La reconnaissance des facteurs d'un mot dans un texte
- Hybrid discrete-continuous systems with control. II: State space method
- A hierarchy of deterministic languages
- Realization is universal
- Asynchronous automata versus asynchronous cellular automata
- Building efficient and compact data structures for simplicial complexes
- Myhill-Nerode type theory for fuzzy languages and automata
- Robust stability of input-output systems with initial conditions
- Geometrical regular languages and linear Diophantine equations: the strongly connected case
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series
- Congruence Relations for Büchi Automata
- Generic results for concatenation hierarchies
- On projective and separable properties
- Syntactic operators on full semiAFLs
- Algebraic realization theory of bilinear discrete-time input-output maps
- Foundations of system theory: Multidecomposable systems
- One way finite visit automata
- On regularity of context-free languages
- The smallest automaton recognizing the subwords of a text
- Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz
- Cut sets as recognizable tree languages
- A geometrical view of the determinization and minimization of finite-state automata
- Quadratic automata
- On the relevance of abstract algebra to control theory
- A succinct canonical register automaton model
- Learning register automata: from languages to program structures
- Average complexity of Moore's and Hopcroft's algorithms
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
- Regular geometrical languages and tiling the plane
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- The state of dynamical input-output systems as an operator
- Finding regular insertion encodings for permutation classes
- AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Mathematical systems theory: Causality
- Computation theory of cellular automata
- Fast equation automaton computation
- Deciding top-down determinism of regular tree languages
- A linear time solution to the single function coarsest partition problem
- Title not available (Why is that?)
- Automata learning with automated alphabet abstraction refinement
- Inferring regular languages and \(\omega\)-languages
- Computing equilibria: a computational complexity perspective
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- One counter languages and the IRS condition
- Recognizability in the Simply Typed Lambda-Calculus
- A generalization of Myhill-Nerode theorem for fuzzy languages
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Minimal realization of machines in closed categories
- Pseudo dynamic hybrid systems
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Title not available (Why is that?)
- Learning residual alternating automata
- Yet another canonical nondeterministic automaton
- Minimizing deterministic lattice automata
- Title not available (Why is that?)
- Records of turing machines
- Geometrical regular languages and linear Diophantine equations
- On nondeterministic-causal time systems
- A beam search algorithm for PFSA inference
- State space construction for continuous time transfer function matrices via Nerode equivalence
- Title not available (Why is that?)
- Learning and characterizing fully-ordered lattice automata
- Minimization of automata for liveness languages
- An approach to deciding the observational equivalence of Algol-like languages
- Yes, the ``missing axiom of matroid theory is lost forever
- Prime languages
- Half-positional objectives recognized by deterministic Büchi automata
- Families of DFAs as acceptors of \(\omega\)-regular languages
- On minimal realization of fuzzy behaviour and associated categories
- Relativized adjacency
- Compatibility of refining and controlling plant automata with bisimulation quotients
- Myhill-Nerode Methods for Hypergraphs
- Certifying DFA bounds for recognition and separation
- Computable execution traces
- Infinitude of primes using formal languages
- New characterizations of primitive permutation groups with applications to synchronizing automata
- The inclusion problem for regular expressions
- Minimizing GFG Transition-Based Automata
This page was built for publication: Linear Automaton Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3264483)
