Finite-memory automata
From MaRDI portal
Publication:1341718
DOI10.1016/0304-3975(94)90242-9zbMath0938.68711OpenAlexW2081396910MaRDI QIDQ1341718
Nissim Francez, Michael Kaminski
Publication date: 15 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90242-9
Related Items
Reactive synthesis from visibly register pushdown automata ⋮ Solving Infinite Games in the Baire Space ⋮ Inferring Canonical Register Automata ⋮ Nominal Kleene Coalgebra ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Enforcing Programming Guidelines with Region Types and Effects ⋮ On notions of regularity for data languages ⋮ Weighted Register Automata and Weighted Logic on Data Words ⋮ Linear equations for unordered data vectors in $[D^k\to{}Z^d$] ⋮ On Pebble Automata for Data Languages with Decidable Emptiness Problem ⋮ Nominal Automata for Resource Usage Control ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Reachability in pushdown register automata ⋮ Layered memory automata: recognizers for quasi-regular languages with unbounded memory ⋮ Unnamed Item ⋮ Nominal monoids ⋮ Automata for XML -- a survey ⋮ Containment of queries for graphs with data ⋮ Unnamed Item ⋮ Complexity results on register context-free grammars and related formalisms ⋮ Separation logics and modalities: a survey ⋮ A taxonomy and reductions for common register automata formalisms ⋮ Finite-State Registered Automata for Non-Concatenative Morphology ⋮ Set augmented finite automata over infinite alphabets ⋮ An algebraic approach to data languages and timed languages ⋮ Active learning for deterministic bottom-up nominal tree automata ⋮ Temporal stream logic modulo theories ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Realizability problem for constraint LTL ⋮ On computability of data word functions defined by transducers ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change ⋮ Relating timed and register automata ⋮ A note on the emptiness problem for alternating finite-memory automata ⋮ On pebble automata for data languages with decidable emptiness problem ⋮ An algebraic characterization of deterministic regular languages over infinite alphabets. ⋮ Nominal Automata with Name Binding ⋮ Unnamed Item ⋮ A succinct canonical register automaton model ⋮ Using variable automata for querying data graphs ⋮ Synthesis of Data Word Transducers ⋮ Algorithmic Nominal Game Semantics ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ Walking on data words ⋮ Variable Tree Automata over Infinite Ranked Alphabets ⋮ CLASS COUNTING AUTOMATA ON DATAWORDS ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ Learning Transparent Data Automata ⋮ Regular and context-free nominal traces ⋮ The navigational power of web browsers ⋮ $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$ ⋮ Model checking usage policies ⋮ Unnamed Item ⋮ FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ Automated Program Verification ⋮ Tree Automata over Infinite Alphabets ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ Unnamed Item ⋮ Optimal run problem for weighted register automata ⋮ Abstraction refinement and antichains for trace inclusion of infinite state systems ⋮ The containment problem for unambiguous register automata and unambiguous timed automata ⋮ Extended symbolic finite automata and transducers ⋮ An Automaton over Data Words That Captures EMSO Logic ⋮ The Containment Problem for Unambiguous Register Automata ⋮ Algorithmic Analysis of Array-Accessing Programs ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures ⋮ Counting Multiplicity over Infinite Alphabets ⋮ Deterministic regular expressions with back-references ⋮ Unnamed Item ⋮ Weighted automata ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA ⋮ BOUNDED PARIKH AUTOMATA ⋮ Intractability of decision problems for finite-memory automata ⋮ Unambiguity in Automata Theory ⋮ REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS ⋮ An automata-theoretic approach to model-checking systems and specifications over infinite data domains ⋮ Unnamed Item ⋮ Weak Cost Register Automata are Still Powerful ⋮ Coalgebraic semantics for nominal automata ⋮ Regular expressions for data words
Cites Work
