Weak Cost Automata over Infinite Trees

Weak Cost Automata over Infinite Trees

Sonraí bibleagrafaíochta
Príomhchruthaitheoir:	Boom, M
Formáid:	Tráchtas
Foilsithe / Cruthaithe:	2012

Míreanna comhchosúla

Weak cost automata over infinite trees
de réir: Vanden Boom, M
Foilsithe / Cruthaithe: (2012)

Weak Cost Monadic Logic over Infinite Trees
de réir: Boom, M
Foilsithe / Cruthaithe: (2011)

Two−way cost automata and cost logics over infinite trees
de réir: Blumensath, A, et al.
Foilsithe / Cruthaithe: (2014)

Quasi−Weak Cost Automata: A New Variant of Weakness
de réir: Kuperberg, D, et al.
Foilsithe / Cruthaithe: (2011)

The Emptiness Problem for Automata on Infinite Trees
de réir: Hossley, Robert, et al.
Foilsithe / Cruthaithe: (2023)

The Emptiness and Complementation Problems for Automata on Infinite Trees
de réir: Rackoff, Charles Weill
Foilsithe / Cruthaithe: (2023)

On the Expressive Power of Cost Logics over Infinite Words
de réir: Kuperberg, D, et al.
Foilsithe / Cruthaithe: (2012)

Weak cost register automata are still powerful
de réir: Almagor, S, et al.
Foilsithe / Cruthaithe: (2018)

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
de réir: Christel Baier, et al.
Foilsithe / Cruthaithe: (2009-07-01)

Automata−based presentations of infinite structures
de réir: Barany, V, et al.
Foilsithe / Cruthaithe: (2010)

Power of Randomization in Automata on Infinite Strings
de réir: Rohit Chadha, et al.
Foilsithe / Cruthaithe: (2011-09-01)

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
de réir: Alexis Bès
Foilsithe / Cruthaithe: (2008-03-01)

Finite Tree Automata and W-Automata
de réir: Hossley, Robert
Foilsithe / Cruthaithe: (2023)

Weak Alternating Timed Automata
de réir: Pawel Parys, et al.
Foilsithe / Cruthaithe: (2012-09-01)

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs
de réir: R. De Castro, et al.
Foilsithe / Cruthaithe: (2014-06-01)

Decision Problems for Deterministic Pushdown Automata on Infinite Words
de réir: Christof Löding
Foilsithe / Cruthaithe: (2014-05-01)

Crisp-determinization of weighted tree automata over strong bimonoids
de réir: Zoltán Fülöp, et al.
Foilsithe / Cruthaithe: (2021-06-01)

Weak equivalence of higher-dimensional automata
de réir: Thomas Kahl
Foilsithe / Cruthaithe: (2021-05-01)

Trees over Infinite Structures and Path Logics with Synchronization
de réir: Alex Spelten, et al.
Foilsithe / Cruthaithe: (2011-11-01)

Deciding the weak definability of Büchi definable tree languages
de réir: Colcombet, T, et al.
Foilsithe / Cruthaithe: (2013)

Reachability Problem for Weak Multi-Pushdown Automata
de réir: Wojciech Czerwiński, et al.
Foilsithe / Cruthaithe: (2013-09-01)

Choice functions and well-orderings over the infinite binary tree
de réir: Carayol Arnaud, et al.
Foilsithe / Cruthaithe: (2010-08-01)

Minimisation of multiplicity tree automata
de réir: Worrell, J, et al.
Foilsithe / Cruthaithe: (2017)

Minimisation of Multiplicity Tree Automata
de réir: Stefan Kiefer, et al.
Foilsithe / Cruthaithe: (2017-03-01)

Pushing for weighted tree automata
de réir: Thomas Hanneforth, et al.
Foilsithe / Cruthaithe: (2018-01-01)

Deterministic Automata for Unordered Trees
de réir: Adrien Boiret, et al.
Foilsithe / Cruthaithe: (2014-08-01)

Automata for Branching and Layered Temporal Structures: an investigation into regularities of infinite transition systems
de réir: Puppis, G
Foilsithe / Cruthaithe: (2010)

A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
de réir: Klaus Aehlig
Foilsithe / Cruthaithe: (2007-07-01)

Weak gardens of Eden for 1-dimensional tessellation automata
de réir: Michael D. Taylor
Foilsithe / Cruthaithe: (1985-01-01)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
de réir: Alessandro Aldini, et al.
Foilsithe / Cruthaithe: (2015-09-01)

Weak factor automata: the failure of failure factor oracles?
de réir: Loek Cleophas, et al.
Foilsithe / Cruthaithe: (2014-08-01)

Test derivation based on tree FSMs and tree automata
de réir: Maria Forostyanova
Foilsithe / Cruthaithe: (2018-10-01)

Visibly Tree Automata with Memory and Constraints
de réir: Hubert Comon-Lundh, et al.
Foilsithe / Cruthaithe: (2008-06-01)

Topological properties of cellular automata on trees
de réir: Gabriele Fici, et al.
Foilsithe / Cruthaithe: (2012-08-01)

On Tree Pattern Matching by Pushdown Automata
de réir: T. Flouri
Foilsithe / Cruthaithe: (2009-01-01)

Some weak covering properties and infinite games
de réir: Sakai Masami
Foilsithe / Cruthaithe: (2014-02-01)

Infinite distances and the axion weak gravity conjecture
de réir: Thomas W. Grimm, et al.
Foilsithe / Cruthaithe: (2020-03-01)

Costs and rewards in priced timed automata
de réir: Fränzle, M, et al.
Foilsithe / Cruthaithe: (2020)

Costs and rewards in priced timed automata
de réir: Fränzle, M, et al.
Foilsithe / Cruthaithe: (2018)

Complexity of equivalence and learning for multiplicity tree automata
de réir: Marusic, I, et al.
Foilsithe / Cruthaithe: (2015)