Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Библиографические подробности
Главный автор:	Boom, M
Формат:	Диссертация
Опубликовано:	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)