The following pages link to Linear Automaton Transformations (Q3264483):
Displayed 44 items.
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- On regularity of context-free languages (Q759489) (← links)
- A linear time solution to the single function coarsest partition problem (Q1063420) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures (Q1077942) (← links)
- 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) (Q1115203) (← links)
- A hierarchy of deterministic languages (Q1136238) (← links)
- Quadratic automata (Q1168081) (← links)
- One counter languages and the IRS condition (Q1218284) (← links)
- Algebraic realization theory of bilinear discrete-time input-output maps (Q1228577) (← links)
- Regular subsets in semi-direct products of monoids (Q1240322) (← links)
- Foundations of system theory: Multidecomposable systems (Q1240690) (← links)
- One way finite visit automata (Q1242687) (← links)
- Sequential fuzzy system identification (Q1255466) (← links)
- The state of dynamical input-output systems as an operator (Q1270932) (← links)
- A beam search algorithm for PFSA inference (Q1271320) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- On projective and separable properties (Q1389766) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Cut sets as recognizable tree languages (Q2493984) (← links)
- Automata theory and control theory - a rapprochement (Q2522559) (← links)
- Time-varying linear sequential machines. I (Q2538531) (← links)
- On the relevance of abstract algebra to control theory (Q2540643) (← links)
- Natural states and past-determinism of general time systems (Q2547877) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Some Remarks on Abstract Machines (Q3275833) (← links)
- Mathematical aspects of physiologically structured populations: the contributions of J. A. J. Metz (Q3520248) (← links)
- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (Q3602802) (← links)
- Doubly-Periodic Sequences and Two-Dimensional Recurrences (Q3688480) (← links)
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series (Q3815540) (← links)
- Strict sets and finite semigroup coverings (Q3952314) (← links)
- (Q4168079) (← links)
- Pseudo dynamic hybrid systems (Q4374211) (← links)
- Minimal realization of machines in closed categories (Q4402100) (← links)
- Some restrictions onW-grammars (Q4776853) (← links)
- Auxiliary functions and constructive specification of general systems (Q5554582) (← links)
- Mathematical systems theory: Causality (Q5584257) (← links)
- Records of turing machines (Q5616139) (← links)
- On nondeterministic-causal time systems (Q5635303) (← links)
- Realization is universal (Q5662078) (← links)