The following pages link to Finite-memory automata (Q1341718):
Displaying 50 items.
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q3451103) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Counting Multiplicity over Infinite Alphabets (Q3646259) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q4640038) (← links)
- (Q4662823) (← links)
- (Q4972736) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5028487) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- Enforcing Programming Guidelines with Region Types and Effects (Q5055996) (← links)
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
- (Q5089311) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- (Q5091269) (← links)
- (Q5092332) (← links)
- (Q5094127) (← links)
- (Q5094137) (← links)
- (Q5111629) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- Learning Transparent Data Automata (Q5166760) (← links)
- REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS (Q5247169) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- (Q5418245) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA (Q5495416) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ (Q5738989) (← links)
- Model checking usage policies (Q5740636) (← links)
- (Q5856426) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- (Q5875342) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- (Q5875386) (← links)
- Fast computations on ordered nominal sets (Q5918532) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
- Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
- $$\textsc {Reach}$$ on Register Automata via History Independence (Q6487290) (← links)
- Decision procedures for sequence theories (Q6535526) (← links)
- Learning deterministic variable automata over infinite alphabets (Q6535973) (← links)
- Orbit-finite-dimensional vector spaces and weighted register automata (Q6566474) (← links)
- Solvability of orbit-finite systems of linear equations (Q6649440) (← links)
- Reasoning on data words over numeric domains (Q6649469) (← links)
- Automata in W-toposes, and general Myhill-Nerode theorems (Q6666775) (← links)
- Automata and grammars for data words (Q6666782) (← links)
