The following pages link to Finite-memory automata (Q1341718):
Displaying 50 items.
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Nominal monoids (Q372971) (← links)
- Finite-state automata in information technologies (Q464949) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Using variable automata for querying data graphs (Q483052) (← links)
- Walking on data words (Q504989) (← links)
- Regular and context-free nominal traces (Q530218) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Extended symbolic finite automata and transducers (Q746776) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Foreground automata (Q1201881) (← links)
- Self-modifying finite automata: An introduction (Q1350286) (← links)
- An algebraic approach to data languages and timed languages (Q1398367) (← links)
- An algebraic characterization of deterministic regular languages over infinite alphabets. (Q1426447) (← links)
- Intractability of decision problems for finite-memory automata (Q1575908) (← 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)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Weighted automata (Q2074206) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231) (← 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)
- A formal model of semantic computing (Q2318288) (← links)
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains (Q2331081) (← 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)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Bounded Parikh automata (Q2841977) (← links)
- Inferring Canonical Register Automata (Q2891417) (← links)
- Nominal Automata for Resource Usage Control (Q2914700) (← links)
- Relating timed and register automata (Q2971073) (← links)
- Nominal Automata with Name Binding (Q2988364) (← 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)
- Finite-State Registered Automata for Non-Concatenative Morphology (Q3225446) (← links)
