Finite-memory automata
From MaRDI portal
Recommendations
Cites work
- Finite-state unification automata and relational languages
- 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?)
- Parallel program schemata
Cited in
(only showing first 100 items - show all)- Foreground automata
- Self-modifying finite automata: An introduction
- An algebraic approach to data languages and timed languages
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Intractability of decision problems for finite-memory automata
- Containment of queries for graphs with data
- Weighted register automata and weighted logic on data words
- On pebble automata for data languages with decidable emptiness problem
- The containment problem for unambiguous register automata and unambiguous timed automata
- Weighted automata
- Coalgebraic semantics for nominal automata
- Reactive synthesis from visibly register pushdown automata
- Layered memory automata: recognizers for quasi-regular languages with unbounded memory
- On computability of data word functions defined by transducers
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Automata over infinite sequences of reals
- Streamable regular transductions
- Deterministic regular expressions with back-references
- A formal model of semantic computing
- An automata-theoretic approach to model-checking systems and specifications over infinite data domains
- Regular expressions for data words
- Reachability in pushdown register automata
- A note on the emptiness problem for alternating finite-memory automata
- Complexity results on register context-free grammars and related formalisms
- Automated program verification
- Regular Programming for Quantitative Properties of Data Streams
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- Bounded Parikh automata
- Inferring canonical register automata
- Finite automata over structures (extended abstract)
- Nominal automata for resource usage control
- Relating timed and register automata
- Nominal automata with name binding
- Algorithmic nominal game semantics
- Variable tree automata over infinite ranked alphabets
- Class counting automata on datawords
- Finite-memory automata with non-deterministic reassignment
- An automaton over data words that captures EMSO logic
- Weighted register automata and weighted logic on data words
- On Pebble Automata for Data Languages with Decidable Emptiness Problem
- Finite-state registered automata for non-concatenative morphology
- scientific article; zbMATH DE number 3876608 (Why is no real title available?)
- On temporal logics with data variable quantifications: decidability and complexity
- Nominal Kleene coalgebra
- Finite automata over infinite alphabets: two models with transitions for local change
- Group Input Machine
- The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata
- Algorithmic Analysis of Array-Accessing Programs
- Counting Multiplicity over Infinite Alphabets
- Nominal monoids
- Separation logics and modalities: a survey
- Finite automata over infinite alphabets: two models with transitions for local change
- Finite-state automata in information technologies
- scientific article; zbMATH DE number 2150274 (Why is no real title available?)
- A succinct canonical register automaton model
- Using variable automata for querying data graphs
- Automata over infinite alphabets
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Residuality and learning for nondeterministic nominal automata
- Solving Infinite Games in the Baire Space
- Walking on data words
- Enforcing Programming Guidelines with Region Types and Effects
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- The containment problem for unambiguous register automata
- A Kleene theorem for nominal automata
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- Register automata with extrema constraints, and an application to two-variable logic
- Determinisability of register and timed automata
- Checking linearizability of concurrent priority queues
- Querying best paths in graph databases
- Modular path queries with arithmetic
- Learning Transparent Data Automata
- Regular expressions for querying data graphs
- Regular and context-free nominal traces
- Extending two-variable logic on data trees with order on data values and its automata
- scientific article; zbMATH DE number 6300094 (Why is no real title available?)
- Tree Automata over Infinite Alphabets
- P and dP automata: unconventional versus classical automata
- Unambiguity in automata theory
- \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
- Model checking usage policies
- Multi-tape Automata with Symbol Classes
- Synthesis of data word transducers
- Weak cost register automata are still powerful
- From equational specifications of algebras with structure to varieties of data languages (invited paper)
- Synthesis of Data Word Transducers
- Register-bounded synthesis
- Fast computations on ordered nominal sets
- Optimal run problem for weighted register automata
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- A taxonomy and reductions for common register automata formalisms
- Set augmented finite automata over infinite alphabets
- 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
- Realizability problem for constraint LTL
- $$\textsc {Reach}$$ on Register Automata via History Independence
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)
