Linear Automaton Transformations

Cited in

(only showing first 100 items - show all)

On regularity of context-free languages
Some Remarks on Abstract Machines
Auxiliary functions and constructive specification of general systems
Average case analysis of Moore's state minimization algorithm
Cycle-aware minimization of acyclic deterministic finite-state automata
On the relevance of abstract algebra to control theory
Active model learning of stochastic reactive systems
Syntactic operators on full semiAFLs
La reconnaissance des facteurs d'un mot dans un texte
Regular geometrical languages and tiling the plane
The smallest automaton recognizing the subwords of a text
From regular expressions to DFA's using compressed NFA's
Computation theory of cellular automata
Sequential fuzzy system identification
T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
Average complexity of Moore's and Hopcroft's algorithms
Myhill-Nerode type theory for fuzzy languages and automata
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
Automata theory and control theory - a rapprochement
Algebraic realization theory of bilinear discrete-time input-output maps
The state complexity of \(L^{2}\) and \(L^k\)
Mathematical systems theory: Causality
Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
Foundations of system theory: Multidecomposable systems
Recognizability in the Simply Typed Lambda-Calculus
Robust stability of input-output systems with initial conditions
scientific article; zbMATH DE number 3602690 (Why is no real title available?)
Automata learning with automated alphabet abstraction refinement
Some restrictions onW-grammars
A generalization of Myhill-Nerode theorem for fuzzy languages
Geometrical regular languages and linear Diophantine equations: the strongly connected case
AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Congruence Relations for Büchi Automata
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
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)
Doubly-Periodic Sequences and Two-Dimensional Recurrences
Minimization of finite state automata through partition aggregation
Minimal realization of machines in closed categories
Hybrid discrete-continuous systems with control. II: State space method
A hierarchy of deterministic languages
Inferring regular languages and \(\omega\)-languages
Generic results for concatenation hierarchies
Quadratic automata
One way finite visit automata
Realization is universal
Partial derivatives of regular expressions and finite automaton constructions
Fast equation automaton computation
One counter languages and the IRS condition
Inverse subsemigroups of finite index in finitely generated inverse semigroups
Syntactic complexity of regular ideals
Deciding top-down determinism of regular tree languages
Natural states and past-determinism of general time systems
On projective and separable properties
Aggregation-based minimization of finite state automata
A geometrical view of the determinization and minimization of finite-state automata
The state of dynamical input-output systems as an operator
Asynchronous automata versus asynchronous cellular automata
Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz
Finding regular insertion encodings for permutation classes
Building efficient and compact data structures for simplicial complexes
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Lower bound methods for the size of nondeterministic finite automata revisited
Pseudo dynamic hybrid systems
Certifying inexpressibility
A succinct canonical register automaton model
Regular subsets in semi-direct products of monoids
Learning register automata: from languages to program structures
A linear time solution to the single function coarsest partition problem
Cut sets as recognizable tree languages
Computing equilibria: a computational complexity perspective
Records of turing machines
Geometrical regular languages and linear Diophantine equations
Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
A beam search algorithm for PFSA inference
New characterizations of primitive permutation groups with applications to synchronizing automata
Canonical automata via distributive law homomorphisms
Time-varying linear sequential machines. I
Families of DFAs as acceptors of \(\omega\)-regular languages
Towards a grand unification of Büchi complementation constructions
Optimal Wheeler language recognition
Compact Normal Form for Regular Languages as Xor Automata
State space construction for continuous time transfer function matrices via Nerode equivalence
Growth rates of permutation classes: categorization up to the uncountability threshold
Recognizability in residuated lattices
Duality of Lattices Associated to Left and Right Quotients
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
\(L^\ast\)-based learning of Markov decision processes (extended version)
On minimal realization of fuzzy behaviour and associated categories
Compositional automata learning of synchronous systems
Alternation hierarchies of first order logic with regular predicates
Learning with limited memory: Bayesianism vs heuristics
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
Learning and characterizing fully-ordered lattice automata
Minimization of automata for liveness languages
Yet another canonical nondeterministic automaton
Compatibility of refining and controlling plant automata with bisimulation quotients
Prime languages
Yes, the ``missing axiom of matroid theory is lost forever
A Myhill-Nerode theorem for register automata and symbolic trace languages

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)