Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Détails bibliographiques
Auteur principal:	Boom, M
Format:	Thèse
Publié:	2012

Documents similaires

Weak cost automata over infinite trees
par: Vanden Boom, M
Publié: (2012)

Weak Cost Monadic Logic over Infinite Trees
par: Boom, M
Publié: (2011)

Two−way cost automata and cost logics over infinite trees
par: Blumensath, A, et autres
Publié: (2014)

Quasi−Weak Cost Automata: A New Variant of Weakness
par: Kuperberg, D, et autres
Publié: (2011)

The Emptiness Problem for Automata on Infinite Trees
par: Hossley, Robert, et autres
Publié: (2023)

The Emptiness and Complementation Problems for Automata on Infinite Trees
par: Rackoff, Charles Weill
Publié: (2023)

On the Expressive Power of Cost Logics over Infinite Words
par: Kuperberg, D, et autres
Publié: (2012)

Weak cost register automata are still powerful
par: Almagor, S, et autres
Publié: (2018)

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
par: Christel Baier, et autres
Publié: (2009-07-01)

Automata−based presentations of infinite structures
par: Barany, V, et autres
Publié: (2010)

Power of Randomization in Automata on Infinite Strings
par: Rohit Chadha, et autres
Publié: (2011-09-01)

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
par: Alexis Bès
Publié: (2008-03-01)

Finite Tree Automata and W-Automata
par: Hossley, Robert
Publié: (2023)

Weak Alternating Timed Automata
par: Pawel Parys, et autres
Publié: (2012-09-01)

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
par: R. De Castro, et autres
Publié: (2014-06-01)

Decision Problems for Deterministic Pushdown Automata on Infinite Words
par: Christof Löding
Publié: (2014-05-01)

Crisp-determinization of weighted tree automata over strong bimonoids
par: Zoltán Fülöp, et autres
Publié: (2021-06-01)

Weak equivalence of higher-dimensional automata
par: Thomas Kahl
Publié: (2021-05-01)

Trees over Infinite Structures and Path Logics with Synchronization
par: Alex Spelten, et autres
Publié: (2011-11-01)

Deciding the weak definability of Büchi definable tree languages
par: Colcombet, T, et autres
Publié: (2013)

Reachability Problem for Weak Multi-Pushdown Automata
par: Wojciech Czerwiński, et autres
Publié: (2013-09-01)

Choice functions and well-orderings over the infinite binary tree
par: Carayol Arnaud, et autres
Publié: (2010-08-01)

Minimisation of multiplicity tree automata
par: Worrell, J, et autres
Publié: (2017)

Minimisation of Multiplicity Tree Automata
par: Stefan Kiefer, et autres
Publié: (2017-03-01)

Pushing for weighted tree automata
par: Thomas Hanneforth, et autres
Publié: (2018-01-01)

Deterministic Automata for Unordered Trees
par: Adrien Boiret, et autres
Publié: (2014-08-01)

Automata for Branching and Layered Temporal Structures: an investigation into regularities of infinite transition systems
par: Puppis, G
Publié: (2010)

A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
par: Klaus Aehlig
Publié: (2007-07-01)

Weak gardens of Eden for 1-dimensional tessellation automata
par: Michael D. Taylor
Publié: (1985-01-01)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
par: Alessandro Aldini, et autres
Publié: (2015-09-01)

Weak factor automata: the failure of failure factor oracles?
par: Loek Cleophas, et autres
Publié: (2014-08-01)

Test derivation based on tree FSMs and tree automata
par: Maria Forostyanova
Publié: (2018-10-01)

Visibly Tree Automata with Memory and Constraints
par: Hubert Comon-Lundh, et autres
Publié: (2008-06-01)

Topological properties of cellular automata on trees
par: Gabriele Fici, et autres
Publié: (2012-08-01)

On Tree Pattern Matching by Pushdown Automata
par: T. Flouri
Publié: (2009-01-01)

Some weak covering properties and infinite games
par: Sakai Masami
Publié: (2014-02-01)

Infinite distances and the axion weak gravity conjecture
par: Thomas W. Grimm, et autres
Publié: (2020-03-01)

Costs and rewards in priced timed automata
par: Fränzle, M, et autres
Publié: (2020)

Costs and rewards in priced timed automata
par: Fränzle, M, et autres
Publié: (2018)

Complexity of equivalence and learning for multiplicity tree automata
par: Marusic, I, et autres
Publié: (2015)