Finite-memory automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- Finite-state unification automata and relational languages
- Parallel program schemata
Cited in
(only showing first 100 items - show all)- Nominal automata with name binding
- On pebble automata for data languages with decidable emptiness problem
- Constraint LTL with remote access
- A note on the emptiness problem for alternating finite-memory automata
- An algebraic approach to data languages and timed languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Regular and context-free nominal traces
- Coalgebraic semantics for nominal automata
- scientific article; zbMATH DE number 7561600 (Why is no real title available?)
- Tree Automata over Infinite Alphabets
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- scientific article; zbMATH DE number 7566055 (Why is no real title available?)
- Complexity of membership and non-emptiness problems in unbounded memory automata
- Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix
- Model checking usage policies
- The navigational power of web browsers
- Orbit-finite-dimensional vector spaces and weighted register automata
- On Pebble Automata for Data Languages with Decidable Emptiness Problem
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains
- Temporal stream logic modulo theories
- Synthesis of data word transducers
- The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
- Reactive synthesis from visibly register pushdown automata
- Separation logics and modalities: a survey
- Church synthesis on register automata over linearly ordered data domains
- Church synthesis on register automata over linearly ordered data domains
- Regular languages in the sliding window model
- Regular Programming for Quantitative Properties of Data Streams
- scientific article; zbMATH DE number 7649885 (Why is no real title available?)
- Algorithmic Analysis of Array-Accessing Programs
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Automated program verification
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- Reachability in pushdown register automata
- Algorithmic nominal game semantics
- Automata for XML -- a survey
- Finite automata over structures (extended abstract)
- Extended symbolic finite automata and transducers
- Querying best paths in graph databases
- Polynomial-time equivalence testing for deterministic fresh-register automata
- An automaton over data words that captures EMSO logic
- Variable tree automata over infinite ranked alphabets
- Bisimilarity in fresh-register automata
- Counting Multiplicity over Infinite Alphabets
- Weak cost register automata are still powerful
- scientific article; zbMATH DE number 7566065 (Why is no real title available?)
- Realizability problem for constraint LTL
- scientific article; zbMATH DE number 2150274 (Why is no real title available?)
- scientific article; zbMATH DE number 6300094 (Why is no real title available?)
- Checking linearizability of concurrent priority queues
- Finite-state automata in information technologies
- Bidimensional linear recursive sequences and universality of unambiguous register automata
- Set augmented finite automata over infinite alphabets
- Bounded languages over infinite alphabets
- Function spaces for orbit-finite sets
- Active learning for deterministic bottom-up nominal tree automata
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- Reachability in distributed memory automata
- What you must remember when transforming datawords
- New techniques for universality in unambiguous register automata
- Single-use automata and transducers for infinite alphabets
- On-the-fly bisimilarity checking for fresh-register automata
- scientific article; zbMATH DE number 7407799 (Why is no real title available?)
- Automata over infinite alphabets
- Weighted register automata and weighted logic on data words
- The containment problem for unambiguous register automata
- The containment problem for unambiguous register automata and unambiguous timed automata
- Weighted register automata and weighted logic on data words
- Streamable regular transductions
- A succinct canonical register automaton model
- Data-aware hybrid tableaux
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- Nominal tree automata with name allocation
- Automating memory model metatheory with intersections
- History-determinism vs fair simulation
- Passive learning of regular data languages in polynomial time and data
- Regular expressions for querying data graphs
- Complementable normal form of parametrized automata
- Learning Transparent Data Automata
- Containment of queries for graphs with data
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- Optimal run problem for weighted register automata
- On temporal logics with data variable quantifications: decidability and complexity
- Bounded Parikh automata
- Finite-state registered automata for non-concatenative morphology
- Fast computations on ordered nominal sets
- Using variable automata for querying data graphs
- Complexity results on register context-free grammars and related formalisms
- P and dP automata: unconventional versus classical automata
- Extending two-variable logic on data trees with order on data values and its automata
- Regular expressions for data words
- Synthesis of Data Word Transducers
- $$\textsc {Reach}$$ on Register Automata via History Independence
- Reasoning on data words over numeric domains
- Solvability of orbit-finite systems of linear equations
- A taxonomy and reductions for common register automata formalisms
- Weighted automata
- Finite automata over infinite alphabets: two models with transitions for local change
- On notions of regularity for data languages
This page was built for publication: Finite-memory automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341718)
