Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας:	Boom, M
Μορφή:	Thesis
Έκδοση:	2012

Παρόμοια τεκμήρια

Weak cost automata over infinite trees
ανά: Vanden Boom, M
Έκδοση: (2012)

Weak Cost Monadic Logic over Infinite Trees
ανά: Boom, M
Έκδοση: (2011)

Two−way cost automata and cost logics over infinite trees
ανά: Blumensath, A, κ.ά.
Έκδοση: (2014)

Quasi−Weak Cost Automata: A New Variant of Weakness
ανά: Kuperberg, D, κ.ά.
Έκδοση: (2011)

The Emptiness Problem for Automata on Infinite Trees
ανά: Hossley, Robert, κ.ά.
Έκδοση: (2023)

The Emptiness and Complementation Problems for Automata on Infinite Trees
ανά: Rackoff, Charles Weill
Έκδοση: (2023)

On the Expressive Power of Cost Logics over Infinite Words
ανά: Kuperberg, D, κ.ά.
Έκδοση: (2012)

Weak cost register automata are still powerful
ανά: Almagor, S, κ.ά.
Έκδοση: (2018)

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
ανά: Christel Baier, κ.ά.
Έκδοση: (2009-07-01)

Automata−based presentations of infinite structures
ανά: Barany, V, κ.ά.
Έκδοση: (2010)

Power of Randomization in Automata on Infinite Strings
ανά: Rohit Chadha, κ.ά.
Έκδοση: (2011-09-01)

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
ανά: Alexis Bès
Έκδοση: (2008-03-01)

Finite Tree Automata and W-Automata
ανά: Hossley, Robert
Έκδοση: (2023)

Weak Alternating Timed Automata
ανά: Pawel Parys, κ.ά.
Έκδοση: (2012-09-01)

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
ανά: R. De Castro, κ.ά.
Έκδοση: (2014-06-01)

Decision Problems for Deterministic Pushdown Automata on Infinite Words
ανά: Christof Löding
Έκδοση: (2014-05-01)

Crisp-determinization of weighted tree automata over strong bimonoids
ανά: Zoltán Fülöp, κ.ά.
Έκδοση: (2021-06-01)

Weak equivalence of higher-dimensional automata
ανά: Thomas Kahl
Έκδοση: (2021-05-01)

Trees over Infinite Structures and Path Logics with Synchronization
ανά: Alex Spelten, κ.ά.
Έκδοση: (2011-11-01)

Deciding the weak definability of Büchi definable tree languages
ανά: Colcombet, T, κ.ά.
Έκδοση: (2013)

Reachability Problem for Weak Multi-Pushdown Automata
ανά: Wojciech Czerwiński, κ.ά.
Έκδοση: (2013-09-01)

Choice functions and well-orderings over the infinite binary tree
ανά: Carayol Arnaud, κ.ά.
Έκδοση: (2010-08-01)

Minimisation of multiplicity tree automata
ανά: Worrell, J, κ.ά.
Έκδοση: (2017)

Minimisation of Multiplicity Tree Automata
ανά: Stefan Kiefer, κ.ά.
Έκδοση: (2017-03-01)

Pushing for weighted tree automata
ανά: Thomas Hanneforth, κ.ά.
Έκδοση: (2018-01-01)

Deterministic Automata for Unordered Trees
ανά: Adrien Boiret, κ.ά.
Έκδοση: (2014-08-01)

Automata for Branching and Layered Temporal Structures: an investigation into regularities of infinite transition systems
ανά: Puppis, G
Έκδοση: (2010)

A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
ανά: Klaus Aehlig
Έκδοση: (2007-07-01)

Weak gardens of Eden for 1-dimensional tessellation automata
ανά: Michael D. Taylor
Έκδοση: (1985-01-01)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
ανά: Alessandro Aldini, κ.ά.
Έκδοση: (2015-09-01)

Weak factor automata: the failure of failure factor oracles?
ανά: Loek Cleophas, κ.ά.
Έκδοση: (2014-08-01)

Test derivation based on tree FSMs and tree automata
ανά: Maria Forostyanova
Έκδοση: (2018-10-01)

Visibly Tree Automata with Memory and Constraints
ανά: Hubert Comon-Lundh, κ.ά.
Έκδοση: (2008-06-01)

Topological properties of cellular automata on trees
ανά: Gabriele Fici, κ.ά.
Έκδοση: (2012-08-01)

On Tree Pattern Matching by Pushdown Automata
ανά: T. Flouri
Έκδοση: (2009-01-01)

Some weak covering properties and infinite games
ανά: Sakai Masami
Έκδοση: (2014-02-01)

Infinite distances and the axion weak gravity conjecture
ανά: Thomas W. Grimm, κ.ά.
Έκδοση: (2020-03-01)

Costs and rewards in priced timed automata
ανά: Fränzle, M, κ.ά.
Έκδοση: (2020)

Costs and rewards in priced timed automata
ανά: Fränzle, M, κ.ά.
Έκδοση: (2018)

Complexity of equivalence and learning for multiplicity tree automata
ανά: Marusic, I, κ.ά.
Έκδοση: (2015)