Pages that link to "Item:Q5277703"
From MaRDI portal
The following pages link to Finite state machines for strings over infinite alphabets (Q5277703):
Displaying 14 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)
- Set augmented finite automata over infinite alphabets (Q6067325) (← links)
- Active learning for deterministic bottom-up nominal tree automata (Q6109488) (← links)
- On-the-fly bisimilarity checking for fresh-register automata (Q6168987) (← links)