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)