The following pages link to Linear Automaton Transformations (Q3264483):
Displaying 50 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- A generalization of Myhill-Nerode theorem for fuzzy languages (Q679811) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- Inverse subsemigroups of finite index in finitely generated inverse semigroups (Q722557) (← links)
- Syntactic operators on full semiAFLs (Q758321) (← links)
- On regularity of context-free languages (Q759489) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Finding regular insertion encodings for permutation classes (Q765858) (← links)
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Myhill-Nerode type theory for fuzzy languages and automata (Q969583) (← links)
- Fast equation automaton computation (Q1018095) (← 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)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- A categorical approach to minimal realization for a fuzzy language (Q1795371) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Yes, the “missing axiom” of matroid theory is lost forever (Q4642529) (← links)
- (Q5089219) (← links)
- (Q5089242) (← links)
- (Q5089311) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- Relativized adjacency (Q6053841) (← links)
- Learning with limited memory: Bayesianism vs heuristics (Q6105380) (← links)
- Forgetful updating and stubborn decision-makers (Q6107379) (← links)
- Inferring Symbolic Automata (Q6135753) (← links)
