Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Detalhes bibliográficos
Autor principal:	Boom, M
Formato:	Thesis
Publicado em:	2012

Registos relacionados

Weak cost automata over infinite trees
Por: Vanden Boom, M
Publicado em: (2012)

Weak Cost Monadic Logic over Infinite Trees
Por: Boom, M
Publicado em: (2011)

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

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

The Emptiness Problem for Automata on Infinite Trees
Por: Hossley, Robert, et al.
Publicado em: (2023)

The Emptiness and Complementation Problems for Automata on Infinite Trees
Por: Rackoff, Charles Weill
Publicado em: (2023)

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

Weak cost register automata are still powerful
Por: Almagor, S, et al.
Publicado em: (2018)

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

Automata−based presentations of infinite structures
Por: Barany, V, et al.
Publicado em: (2010)

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

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

Finite Tree Automata and W-Automata
Por: Hossley, Robert
Publicado em: (2023)

Weak Alternating Timed Automata
Por: Pawel Parys, et al.
Publicado em: (2012-09-01)

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

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

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

Weak equivalence of higher-dimensional automata
Por: Thomas Kahl
Publicado em: (2021-05-01)

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

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

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

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

Minimisation of multiplicity tree automata
Por: Worrell, J, et al.
Publicado em: (2017)

Minimisation of Multiplicity Tree Automata
Por: Stefan Kiefer, et al.
Publicado em: (2017-03-01)

Pushing for weighted tree automata
Por: Thomas Hanneforth, et al.
Publicado em: (2018-01-01)

Deterministic Automata for Unordered Trees
Por: Adrien Boiret, et al.
Publicado em: (2014-08-01)

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

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

Weak gardens of Eden for 1-dimensional tessellation automata
Por: Michael D. Taylor
Publicado em: (1985-01-01)

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

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

Test derivation based on tree FSMs and tree automata
Por: Maria Forostyanova
Publicado em: (2018-10-01)

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

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

On Tree Pattern Matching by Pushdown Automata
Por: T. Flouri
Publicado em: (2009-01-01)

Some weak covering properties and infinite games
Por: Sakai Masami
Publicado em: (2014-02-01)

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

Costs and rewards in priced timed automata
Por: Fränzle, M, et al.
Publicado em: (2020)

Costs and rewards in priced timed automata
Por: Fränzle, M, et al.
Publicado em: (2018)

Complexity of equivalence and learning for multiplicity tree automata
Por: Marusic, I, et al.
Publicado em: (2015)