Pages that link to "Item:Q5277703"
From MaRDI portal
The following pages link to Finite state machines for strings over infinite alphabets (Q5277703):
Displaying 46 items.
- Program equivalence in a simple language with state (Q456473) (← links)
- Symbolic tree automata (Q483051) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Walking on data words (Q504989) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Containment of queries for graphs with data (Q1678169) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- Subsequence versus substring constraints in sequence pattern languages (Q2022305) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Streamable regular transductions (Q2286735) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Automated Program Verification (Q2799160) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Relating timed and register automata (Q2971073) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- CLASS COUNTING AUTOMATA ON DATAWORDS (Q3016221) (← links)
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT (Q3056277) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- On Pebble Automata for Data Languages with Decidable Emptiness Problem (Q3182968) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- (Q5089311) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- (Q5091269) (← links)
- (Q5136335) (← links)
- Synthesis of Data Word Transducers (Q5875385) (← links)
