Linear Automaton Transformations
From MaRDI portal
Publication:3264483
Cited in
(only showing first 100 items - show all)- 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
- On regularity of context-free languages
- New characterizations of primitive permutation groups with applications to synchronizing automata
- The smallest automaton recognizing the subwords of a text
- Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz
- Minimizing GFG Transition-Based Automata
- Cut sets as recognizable tree languages
- scientific article; zbMATH DE number 7455749 (Why is no real title available?)
- Alternation hierarchies of first order logic with regular predicates
- A geometrical view of the determinization and minimization of finite-state automata
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- An efficient algorithm for the construction of the equation tree automaton
- 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
- Manipulation of regular expressions using derivatives: an overview
- A categorical approach to minimal realization for a fuzzy language
- Recognizability in residuated lattices
- Duality of Lattices Associated to Left and Right Quotients
- Regular geometrical languages and tiling the plane
- Finding regular insertion encodings for permutation classes
- The state of dynamical input-output systems as an operator
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
- Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Growth rates of permutation classes: categorization up to the uncountability threshold
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Strict sets and finite semigroup coverings
- scientific article; zbMATH DE number 7471718 (Why is no real title available?)
- Mathematical systems theory: Causality
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)