Pages that link to "Item:Q5277703"
From MaRDI portal
The following pages link to Finite state machines for strings over infinite alphabets (Q5277703):
Displaying 16 items.
- (Q5094137) (← links)
- (Q5136335) (← links)
- (Q5155690) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)
- Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (Q5200029) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- (Q5856426) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
- Optimal run problem for weighted register automata (Q5919052) (← links)
- A taxonomy and reductions for common register automata formalisms (Q6045033) (← links)
- Automatic program instrumentation for automatic verification (Q6535688) (← 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 and grammars for data words (Q6666782) (← links)