Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Dades bibliogràfiques
Autor principal:	Boom, M
Format:	Thesis
Publicat:	2012

Ítems similars

Weak cost automata over infinite trees
per: Vanden Boom, M
Publicat: (2012)

Weak Cost Monadic Logic over Infinite Trees
per: Boom, M
Publicat: (2011)

Two−way cost automata and cost logics over infinite trees
per: Blumensath, A, et al.
Publicat: (2014)

Quasi−Weak Cost Automata: A New Variant of Weakness
per: Kuperberg, D, et al.
Publicat: (2011)

The Emptiness Problem for Automata on Infinite Trees
per: Hossley, Robert, et al.
Publicat: (2023)

The Emptiness and Complementation Problems for Automata on Infinite Trees
per: Rackoff, Charles Weill
Publicat: (2023)

On the Expressive Power of Cost Logics over Infinite Words
per: Kuperberg, D, et al.
Publicat: (2012)

Weak cost register automata are still powerful
per: Almagor, S, et al.
Publicat: (2018)

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
per: Christel Baier, et al.
Publicat: (2009-07-01)

Automata−based presentations of infinite structures
per: Barany, V, et al.
Publicat: (2010)

Power of Randomization in Automata on Infinite Strings
per: Rohit Chadha, et al.
Publicat: (2011-09-01)

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

Finite Tree Automata and W-Automata
per: Hossley, Robert
Publicat: (2023)

Weak Alternating Timed Automata
per: Pawel Parys, et al.
Publicat: (2012-09-01)

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
per: R. De Castro, et al.
Publicat: (2014-06-01)

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

Crisp-determinization of weighted tree automata over strong bimonoids
per: Zoltán Fülöp, et al.
Publicat: (2021-06-01)

Weak equivalence of higher-dimensional automata
per: Thomas Kahl
Publicat: (2021-05-01)

Trees over Infinite Structures and Path Logics with Synchronization
per: Alex Spelten, et al.
Publicat: (2011-11-01)

Deciding the weak definability of Büchi definable tree languages
per: Colcombet, T, et al.
Publicat: (2013)

Reachability Problem for Weak Multi-Pushdown Automata
per: Wojciech Czerwiński, et al.
Publicat: (2013-09-01)

Choice functions and well-orderings over the infinite binary tree
per: Carayol Arnaud, et al.
Publicat: (2010-08-01)

Minimisation of multiplicity tree automata
per: Worrell, J, et al.
Publicat: (2017)

Minimisation of Multiplicity Tree Automata
per: Stefan Kiefer, et al.
Publicat: (2017-03-01)

Pushing for weighted tree automata
per: Thomas Hanneforth, et al.
Publicat: (2018-01-01)

Deterministic Automata for Unordered Trees
per: Adrien Boiret, et al.
Publicat: (2014-08-01)

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

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

Weak gardens of Eden for 1-dimensional tessellation automata
per: Michael D. Taylor
Publicat: (1985-01-01)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
per: Alessandro Aldini, et al.
Publicat: (2015-09-01)

Weak factor automata: the failure of failure factor oracles?
per: Loek Cleophas, et al.
Publicat: (2014-08-01)

Test derivation based on tree FSMs and tree automata
per: Maria Forostyanova
Publicat: (2018-10-01)

Visibly Tree Automata with Memory and Constraints
per: Hubert Comon-Lundh, et al.
Publicat: (2008-06-01)

Topological properties of cellular automata on trees
per: Gabriele Fici, et al.
Publicat: (2012-08-01)

On Tree Pattern Matching by Pushdown Automata
per: T. Flouri
Publicat: (2009-01-01)

Some weak covering properties and infinite games
per: Sakai Masami
Publicat: (2014-02-01)

Infinite distances and the axion weak gravity conjecture
per: Thomas W. Grimm, et al.
Publicat: (2020-03-01)

Costs and rewards in priced timed automata
per: Fränzle, M, et al.
Publicat: (2020)

Costs and rewards in priced timed automata
per: Fränzle, M, et al.
Publicat: (2018)

Complexity of equivalence and learning for multiplicity tree automata
per: Marusic, I, et al.
Publicat: (2015)