Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Bibliografske podrobnosti
Glavni avtor:	Boom, M
Format:	Thesis
Izdano:	2012

Podobne knjige/članki

Weak cost automata over infinite trees
od: Vanden Boom, M
Izdano: (2012)

Weak Cost Monadic Logic over Infinite Trees
od: Boom, M
Izdano: (2011)

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

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

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

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

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

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

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

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

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

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

Finite Tree Automata and W-Automata
od: Hossley, Robert
Izdano: (2023)

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

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

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

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

Weak equivalence of higher-dimensional automata
od: Thomas Kahl
Izdano: (2021-05-01)

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

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

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

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

Minimisation of multiplicity tree automata
od: Worrell, J, et al.
Izdano: (2017)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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