Results 31 to 40 of about 1,576 (262)
On the Efficient Representation of an Unbounded Resource with the Aid of One-Counter Circuits
Моделирование и анализ информационных систем, 2013 A class of infinite-state automata with a simple periodic behaviour and a convenient graphical representation is studied. A positive one-counter circuit is defined as a strongly connected one-counter net (one-counter nondeterministic finite automata ...
V. A. Bashkin
doaj +3 more sources
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems [PDF]
Logical Methods in Computer Science, 2016 A data tree is an unranked ordered tree where each node carries a label from a finite alphabet and a datum from some infinite domain. We consider the two variable first order logic FO2(
Florent Jacquemard +2 more
doaj +1 more source
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
Crisp-determinization of weighted tree automata over strong bimonoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, the ...
Zoltán Fülöp +2 more
doaj +1 more source
, 2012 Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes.
openaire +3 more sources
Propositional Tree Automata [PDF]
, 2006 In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a sufficient completeness checker for specifications with rewriting modulo an equational theory ...
Hendrix, Joe +2 more
openaire +1 more source
Weighted Tree Automata with Constraints
Theory of Computing Systems, 2022 AbstractThe HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages.
Andreas Maletti, Andreea-Teodora Nász
openaire +3 more sources
On a representation of tree automata
Theoretical Computer Science, 1987 All algebras (or tree automata) considered in this paper are finite with a finite number of operations of some fixed arity. In the usual Gluskov- type general product of algebras there is a feedback function which selects for each component algebra the operation to be performed next.
Zoltán Ésik, Ferenc Gécseg
openaire +1 more source
Journal of Computer and System Sciences, 1985 The paper presents a new type of automata called tree pushdown automata. This type of automata operates in the same manner as standard bottom-up tree automata except that there is an internal memory consisting of a finite sequence of trees (called tree stack), where there is exactly one tree stack for each read head in a bottom-up tree automaton.
Karl M. Schimpf, Jean H. Gallier
openaire +2 more sources
, 2009 We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a restriction on the computation of RTA on trees: RTA can test for equality in subtrees reaching the same rigid state.
Jacquemard, Florent +2 more
openaire +1 more source