Linear Automaton Transformations

Cited in

(only showing first 100 items - show all)

Canonical automata via distributive law homomorphisms
Compositional automata learning of synchronous systems
scientific article; zbMATH DE number 7559422 (Why is no real title available?)
Computation theory of cellular automata
scientific article; zbMATH DE number 7625165 (Why is no real title available?)
Time-varying linear sequential machines. I
Compact Normal Form for Regular Languages as Xor Automata
Learning with limited memory: Bayesianism vs heuristics
Inferring Symbolic Automata
Forgetful updating and stubborn decision-makers
Active automata learning as black-box search and lazy partition refinement
Fast equation automaton computation
Deciding top-down determinism of regular tree languages
A linear time solution to the single function coarsest partition problem
Automata in W-toposes, and general Myhill-Nerode theorems
Inferring regular languages and \(\omega\)-languages
Automata learning with automated alphabet abstraction refinement
Computing equilibria: a computational complexity perspective
scientific article; zbMATH DE number 3602690 (Why is no real title available?)
Execution trace sets for real computation
T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
Towards a grand unification of Büchi complementation constructions
\(L^*\)-based learning of Markov decision processes
Pumping, with or without choice
Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
One counter languages and the IRS condition
Two observations in dioid based model refinement
Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
Optimal Wheeler language recognition
A generalization of Myhill-Nerode theorem for fuzzy languages
Yet another canonical nondeterministic automaton
The genus of regular languages
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
Recognizability in the Simply Typed Lambda-Calculus
Doubly-Periodic Sequences and Two-Dimensional Recurrences
Minimal realization of machines in closed categories
Sequential fuzzy system identification
Pseudo dynamic hybrid systems
\(L^\ast\)-based learning of Markov decision processes (extended version)
Regular subsets in semi-direct products of monoids
scientific article; zbMATH DE number 7559440 (Why is no real title available?)
Learning residual alternating automata
Active model learning of stochastic reactive systems
Certifying inexpressibility
Lower bound methods for the size of nondeterministic finite automata revisited
The state complexity of \(L^{2}\) and \(L^k\)
Partial derivatives of regular expressions and finite automaton constructions
Yet another canonical nondeterministic automaton
From regular expressions to DFA's using compressed NFA's
Average case analysis of Moore's state minimization algorithm
Minimizing deterministic lattice automata
scientific article; zbMATH DE number 7577580 (Why is no real title available?)
Records of turing machines
Some restrictions onW-grammars
Geometrical regular languages and linear Diophantine equations
A beam search algorithm for PFSA inference
On nondeterministic-causal time systems
Natural states and past-determinism of general time systems
State space construction for continuous time transfer function matrices via Nerode equivalence
scientific article; zbMATH DE number 7559500 (Why is no real title available?)
Automata theory and control theory - a rapprochement
An approach to deciding the observational equivalence of Algol-like languages
Learning and characterizing fully-ordered lattice automata
Minimization of automata for liveness languages
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)
Auxiliary functions and constructive specification of general systems
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
Prime languages
Aggregation-based minimization of finite state automata
La reconnaissance des facteurs d'un mot dans un texte
Yes, the ``missing axiom of matroid theory is lost forever
A hierarchy of deterministic languages
Half-positional objectives recognized by deterministic Büchi automata
Asynchronous automata versus asynchronous cellular automata
Hybrid discrete-continuous systems with control. II: State space method
Building efficient and compact data structures for simplicial complexes
Myhill-Nerode type theory for fuzzy languages and automata
Geometrical regular languages and linear Diophantine equations: the strongly connected case
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Realization is universal
On minimal realization of fuzzy behaviour and associated categories
Families of DFAs as acceptors of \(\omega\)-regular languages
Robust stability of input-output systems with initial conditions
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Relativized adjacency
On projective and separable properties
Generic results for concatenation hierarchies
Syntactic operators on full semiAFLs
Compatibility of refining and controlling plant automata with bisimulation quotients
Congruence Relations for Büchi Automata
Certifying DFA bounds for recognition and separation
Computable execution traces
Algebraic realization theory of bilinear discrete-time input-output maps
Foundations of system theory: Multidecomposable systems
Infinitude of primes using formal languages
The inclusion problem for regular expressions
One way finite visit 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)