Cited in
(only showing first 100 items - show all)- Fast equation automaton computation
- A linear time solution to the single function coarsest partition problem
- The smallest automaton recognizing the subwords of a text
- Computation theory of cellular automata
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- 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)
- A hierarchy of deterministic languages
- Quadratic automata
- One counter languages and the IRS condition
- Algebraic realization theory of bilinear discrete-time input-output maps
- Regular subsets in semi-direct products of monoids
- Foundations of system theory: Multidecomposable systems
- One way finite visit automata
- Sequential fuzzy system identification
- The state of dynamical input-output systems as an operator
- A beam search algorithm for PFSA inference
- Asynchronous automata versus asynchronous cellular automata
- On projective and separable properties
- From regular expressions to DFA's using compressed NFA's
- Inferring regular languages and \(\omega\)-languages
- The inclusion problem for regular expressions
- A categorical approach to minimal realization for a fuzzy language
- An approach to deciding the observational equivalence of Algol-like languages
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Aggregation-based minimization of finite state automata
- Learning residual alternating automata
- Yet another canonical nondeterministic automaton
- Deciding top-down determinism of regular tree languages
- Certifying DFA bounds for recognition and separation
- Computable execution traces
- Manipulation of regular expressions using derivatives: an overview
- Growth rates of permutation classes: categorization up to the uncountability threshold
- Certifying inexpressibility
- Generic results for concatenation hierarchies
- Hybrid discrete-continuous systems with control. II: State space method
- Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Building efficient and compact data structures for simplicial complexes
- Average case analysis of Moore's state minimization algorithm
- Cut sets as recognizable tree languages
- On minimal realization of fuzzy behaviour and associated categories
- Prime languages
- Automata theory and control theory - a rapprochement
- Time-varying linear sequential machines. I
- On the relevance of abstract algebra to control theory
- Natural states and past-determinism of general time systems
- Execution trace sets for real computation
- Two observations in dioid based model refinement
- Alternation hierarchies of first order logic with regular predicates
- Regular geometrical languages and tiling the plane
- Automata learning with automated alphabet abstraction refinement
- A geometrical view of the determinization and minimization of finite-state automata
- Some Remarks on Abstract Machines
- AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
- Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz
- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
- Compact Normal Form for Regular Languages as Xor Automata
- Recognizability in the Simply Typed Lambda-Calculus
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series
- Strict sets and finite semigroup coverings
- scientific article; zbMATH DE number 3602690 (Why is no real title available?)
- Pseudo dynamic hybrid systems
- Minimal realization of machines in closed categories
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Geometrical regular languages and linear Diophantine equations: the strongly connected case
- The genus of regular languages
- Families of DFAs as acceptors of -regular languages
- Yes, the ``missing axiom of matroid theory is lost forever
- Infinitude of primes using formal languages
- Some restrictions onW-grammars
- A succinct canonical register automaton model
- Learning register automata: from languages to program structures
- An efficient algorithm for the construction of the equation tree automaton
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Canonicity in GFG and transition-based automata
- Residuality and learning for nondeterministic nominal automata
- scientific article; zbMATH DE number 7625165 (Why is no real title available?)
- scientific article; zbMATH DE number 7559422 (Why is no real title available?)
- scientific article; zbMATH DE number 7559440 (Why is no real title available?)
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- Minimizing GFG Transition-Based Automata
- Minimization and canonization of GFG transition-based automata
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Geometrical regular languages and linear Diophantine equations
- Robust stability of input-output systems with initial conditions
- Auxiliary functions and constructive specification of general systems
- Mathematical systems theory: Causality
- Records of turing machines
- On nondeterministic-causal time systems
- Realization is universal
- Minimization of finite state automata through partition aggregation
- Lower bound methods for the size of nondeterministic finite automata revisited
- La reconnaissance des facteurs d'un mot dans un texte
- Minimizing deterministic lattice automata
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Active model learning of stochastic reactive systems
- Relativized adjacency
- Learning with limited memory: Bayesianism vs heuristics
- Forgetful updating and stubborn decision-makers
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)
