42,322 Hits in 3.0 sec

Deterministic Set Automata [chapter]

Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014 Lecture Notes in Computer Science  
We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium.  ...  In this paper, we consider deterministic set automata (DSA) that extend deterministic finite automata by adding the storage medium of a set which, in contrast to bag automata, allows words to be stored  ...  Introduction In this section, we study the computational power of deterministic set automata. Hence, we compare the model with the known models of pushdown automata and queue automata.  ... 
doi:10.1007/978-3-319-09698-8_27 fatcat:cl5fiq6worbgzh54c32py45fdu

Minimization of Deterministic Fuzzy Tree Automata

S. Moghari, M. M. Zahedi
2014 Journal of Fuzzy Set Valued Analysis  
Until now, some methods for minimizing deterministic fuzzy finite tree automata (DFFTA) and weighted tree automata have been established by researchers.  ...  The second step is refinement of MDG and making minimization equivalency set (MES).  ...  Current studies on minimizing DFFTA 0 and deterministic weighted tree automata 0, focus on the second relation for similarity measure between the language of original automaton and its minimal version.  ... 
doi:10.5899/2014/jfsva-00191 fatcat:jglesdnghrdjxcosn626f5bloa

Bounded epsilon-Reach Set Computation of a Class of Deterministic and Transversal Linear Hybrid Automata [article]

Kyoung-Dae Kim and Sayan Mitra and P. R. Kumar
2012 arXiv   pre-print
We define a special class of hybrid automata, called Deterministic and Transversal Linear Hybrid Automata (DTLHA), whose continuous dynamics in each location are linear time-invariant (LTI) with a constant  ...  set, called a bounded epsilon-reach set, through sampling and polyhedral over-approximation of sampled states.  ...  CONCLUSION We have defined a special class of hybrid automata, called Deterministic and Transversal Linear Hybrid Automata (DTLHA), for which we can address the problem of bounded -reach set computation  ... 
arXiv:1205.3426v1 fatcat:45bddcmikra7vhgbah6fismaxq

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings [chapter]

Jan Daciuk
2003 Lecture Notes in Computer Science  
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words.  ...  Motivation During last 12 years, one could see emergence of construction methods specialized for minimal, acyclic, deterministic, finite-state automata.  ...  Experiments Data sets for evaluation were taken from the domain of Natural language Processing (NLP). Acyclic automata are widely used as dictionaries.  ... 
doi:10.1007/3-540-44977-9_26 fatcat:ebn4ohc5jrga7lwqb5723v32ta

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs [chapter]

John P. Gallagher, Germán Puebla
2001 Lecture Notes in Computer Science  
doi:10.1007/3-540-45587-6_16 fatcat:ayqorp4jprbtlclcf2zghasxke

Restricted deterministic Watson-Crick automata [article]

Kingshuk Chatterjee, Kumar Sankar Ray
2016 arXiv   pre-print
We also show that computational power of restricted deterministic Watson- Crick automata with L in regular languages is same as that of deterministic Watson-Crick automata and that the set of all languages  ...  accepted by restricted deterministic Watson-Crick automata with L in unary regular languages is a proper subset of context free languages.  ...  Thus the set of all languages accepted by restricted deterministic Watson-Crick automata where L is regular contains the set of all languages accepted by deterministic Watson-Crick automata.  ... 
arXiv:1602.05721v1 fatcat:s4szypboqjfvvgjwu75p2orx34

Generalized automata on infinite trees and Muller-McNaughton's Theorem

A. Saoudi
1991 Theoretical Computer Science  
We study the power of deterministic and nondeterministic generalized tree automata and prove that deterministic and nondeterministic bottom-up automata accept the same class.  ...  We introduce various types of top-down and bottom-up generalized automata on infinite trees.  ...  are limit of sets accepted by deterministic top-down tree automata. (7) The family of sets accepted by deterministic R-automata is equal to the boolean closure of sets accepted by deterministic S-automata  ... 
doi:10.1016/0304-3975(91)90158-x fatcat:stu3kufrzbhanb5qdyhsfbzdha

Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization [chapter]

František Blahoudek, Alexandre Duret-Lutz, Jan Strejček
2020 Lecture Notes in Computer Science  
In connection with the state-of-the-art LTL to TGBAs translator Spot, Seminator 2 produces smaller (on average) semi-deterministic automata than the direct LTL to semi-deterministic automata translator  ...  We present the second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into equivalent semi-deterministic automata.  ...  Fig. 4 . 4 Comparison of the sizes of the semi-deterministic automata produced by Seminator 2 and Owl for the not semideterministic random set.  ... 
doi:10.1007/978-3-030-53291-8_2 fatcat:5cdx2umrffhrrpgvx7ysvhj5d4

The Hanoi Omega-Automata Format [chapter]

Tomáš Babiak, František Blahoudek, Alexandre Duret-Lutz, Joachim Klein, Jan Křetínský, David Müller, David Parker, Jan Strejček
2015 Lecture Notes in Computer Science  
The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata.  ...  We propose a flexible exchange format for ω-automata, as typically used in formal verification, and implement support for it in a range of established tools.  ...  LTL into state-and transition-based variants of deterministic Rabin automata and generalized deterministic Rabin automata.  ... 
doi:10.1007/978-3-319-21690-4_31 fatcat:ojzyxonqung2tpxerm3qusra6i

Technique to Remove Indistinguishable State with Unreachable State and Dead State from Deterministic Finite Automata

Dipanshu Rastogi, Ravinder Singh
2014 International Journal of Computer Applications  
A central problem in automata theory is to minimize a given Deterministic Finite Automaton (DFA).  ...  finite automata).And removing unreachable state and dead state from deterministic finite automata is very necessary to generating useful string.  ...  F :set of final states ; F⊆Q Note that, above definition is valid for both DFAs (deterministic finite automata), and NFAs (nondeterministic finite automata) [6, 7] .  ... 
doi:10.5120/16311-5540 fatcat:3b5dmcomjfgm5a6ak2nmgcs3om

Beyond omega-Regular Languages

Mikolaj Bojanczyk, Marc Herbstritt
2010 Symposium on Theoretical Aspects of Computer Science  
It can be described using automata, namely by nondeterministic Büchi automata, or the equivalent deterministic Muller automata.  ...  The notion of ω-regular language is well established in the theory of automata.  ...  Above, we have described several classes of languages of ω-words, defined by: the logics with new quantifiers and automata with counters.  ... 
doi:10.4230/lipics.stacs.2010.2440 dblp:conf/stacs/Bojanczyk10 fatcat:6oaslsh6kndxzixfk6zzpwqj7m

Automata on infinite objects and their applications to logic and programming

M. Nivat, A. Saoudi
1989 Information and Computation  
We study the power of deterministic and nondeterministic tree automata and prove that deterministic and non-deterministic bottomup tree automata accept the same intinite tree sets.  ...  We introduce various types of w-automata, top-down automata and bottom-up automata on infinite trees.  ...  Mostowski (1982) proved that nondeterministic top-down Rabin's automata and deterministic bottom-up Rabin automata accept the same sets. In A.  ... 
doi:10.1016/0890-5401(89)90046-1 fatcat:piaswcbfefhabk44evsjezfow4


R. Cokilavany, R. Venkatesan, J. Kavikumar
2015 International Journal of Pure and Applied Mathematics  
Finally, we give some closure properties of fuzzy deterministic ω -automata.  ...  Further, we define the transition fuzzy ω -automata and show that these automata recognize the same fuzzy language as in the fuzzy ω -automata.  ...  It is deterministic if it has deterministic transition. Let A * denote the set of finite words on A and A + denote the set of nonempty finite words on A and Λ denote an empty word.  ... 
doi:10.12732/ijpam.v99i1.3 fatcat:mnlyzyedhnecrjckib2ytszzfa

Ultrametric Automata with One Head Versus Multihead Nondeterministic Automata

Maksims Dimitrijevs, Irina Scegulnaja
2015 Conference on Current Trends in Theory and Practice of Informatics  
In this paper advantages of ultrametric automata with one head versus multihead deterministic and nondeterministic automata are observed.  ...  In the last two years some advantages of ultrametric algorithms for finite automata and Turing machines were explored.  ...  For every prime number p for every k ≥ 1 set of languages recognized by one-way deterministic finite automata with k heads is a proper subset of the set of languages, that can be recognized by one-way  ... 
dblp:conf/sofsem/DimitrijevsS15 fatcat:nwqjp7k5mbcljlchtq5pbcrajm

A Machine-Independent Characterization of Timed Languages [chapter]

Mikołaj Bojańczyk, Sławomir Lasota
2012 Lecture Notes in Computer Science  
The first result is a machineindependent characterization of languages of deterministic timed automata.  ...  We use a variant of Fraenkel-Mostowski sets (known also as nominal sets) as a framework suitable for stating and proving the following two results on timed automata.  ...  We prove that, unlike for deterministic timed automata, deterministic timed register automata are closed under minimization.  ... 
doi:10.1007/978-3-642-31585-5_12 fatcat:bcvcd4drxfh2jffyydxggvqbnu
« Previous Showing results 1 — 15 out of 42,322 results