31,627 Hits in 4.8 sec

Mobile Learning Application for Language and Automata Theory using Android-based

Maulana Muhamad Sulaiman, Romi Andrianto, Muhamad Arief Yulianto
2020 JOIN: Jurnal Online Informatika  
finite automata (DFA) based on android as an evaluation of learning media for students.  ...  The assist students to understand the material, it is need to develop the learning media for mobile learning applications for language and automata theory on finite state automata (FSA) and deterministic  ...  ACKNOWLEDGEMENTS The author is grateful to Kemenristek Dikti to gives grant funding for this research.  ... 
doi:10.15575/join.v5i2.630 fatcat:tu2tyq6djba7fmtg4gxgw4kily

More on Deterministic and Nondeterministic Finite Cover Automata [chapter]

Hermann Gruber, Markus Holzer, Sebastian Jakobi
2015 Lecture Notes in Computer Science  
Finally, we present some results on the average size of finite cover automata.  ...  of finite languages by ordinary finite automata.  ...  This model was used in [17] to compare the number of states or transitions of ordinary finite automata on average.  ... 
doi:10.1007/978-3-319-22360-5_10 fatcat:xezi36ob3bcirfm3ssikhhtyuq

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata [chapter]

Nicolas Bousquet, Christof Löding
2010 Lecture Notes in Computer Science  
We generalize this to Büchi automata with a fixed finite degree of ambiguity in the strong sense.  ...  We also discuss the problems that arise when considering the decision problems for the standard notion of ambiguity for Büchi automata.  ...  The polynomial time equivalence test over finite words from [10] uses a counting argument: The main idea is that, for unambiguous automata, the number of accepting runs is equal to the number of accepted  ... 
doi:10.1007/978-3-642-13089-2_10 fatcat:wx5abl6o7ffh3idls3q73rtp2y

Ultrametric Finite Automata and Their Capabilities

Maksims Dimitrijevs, Kristīne Cīpola
2016 Baltic Journal of Modern Computing  
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation.  ...  Previous research has shown that ultrametric automata can recognize complex languages and can have small number of states when classical automata require much more states.  ...  To get the result after reading the input word, the amplitude of every accepting state is transformed into p-norm and the word is accepted if and only if sum of p-norms of accepting states satisfies the  ... 
doi:10.22364/bjmc.2016.4.4.19 fatcat:dud35ixagjhqbeosca3em33iky

On the descriptional complexity of finite automata with modified acceptance conditions

Markus Holzer, Martin Kutrib
2005 Theoretical Computer Science  
We consider deterministic and nondeterministic finite automata with acceptance conditions that rely on the whole history of a computation on a given word and not only on the last state of the computation  ...  Formally, these conditions can be seen as the natural analogies of the Büchi and Muller acceptance for finite automata on infinite words.  ...  Moreover, it remains to consider state complexity results for the direct conversion of a nondeterministic finite automaton that B-accepts a language to an equivalent finite state device M-accepting the  ... 
doi:10.1016/j.tcs.2004.06.030 fatcat:z5d3lw32bza2hla4uojuyfykvm

Parallel communicating one-way reversible finite automata system [article]

Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
2019 arXiv   pre-print
On the basis of which we conjecture that parallel communicating one-way reversible finite automata systems may accept languages not accepted by multi-head one way reversible finite automata.  ...  We show that unlike the multi-head one way reversible finite automata model (where we are still not sure whether it accepts all the regular languages) parallel communicating one-way reversible finite automata  ...  The problem arises when we consider one way variants of the reversible models [3, 4] . One-way reversible finite automata cannot accept all regular languages [5] .  ... 
arXiv:1903.10428v1 fatcat:3dp2woqeuvgd5cgxfgmippjc34

Quantum finite automata: survey, status and research directions [article]

Amandeep Singh Bhatia, Ajay Kumar
2019 arXiv   pre-print
In light of the current state of quantum computation theory research, a systematic review of the literature seems timely.  ...  Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level.  ...  Acknowledgments Amandeep Singh Bhatia was supported by Maulana Azad National Fellowship (MANF), funded by Ministry of Minority Affairs, Government of India.  ... 
arXiv:1901.07992v1 fatcat:yoxwrd6e55gh3heapwy3w5uuhm

Multi-head Watson-Crick quantum finite automata [article]

Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray
2020 arXiv   pre-print
In fact we also show that the multi-head variant accepts a language which is not accepted by any one-way multi-head deterministic finite automata.  ...  Watson-Crick quantum finite automata were introduced by Ganguly by combining properties of DNA and Quantum automata. In this paper we introduce a multi-head version of the above automaton.  ...  The symbol k 1 denotes the number of heads on the upper strand and k 2 denotes the number of heads on the lower strand. The word on the upper strand is accepted or rejected by the automaton.  ... 
arXiv:2005.10127v1 fatcat:ga5cwl6pz5dbfapospkdw5jvha

Page 299 of Mathematical Reviews Vol. 45, Issue 1 [page]

1973 Mathematical Reviews  
F. 1691 Minimization of the number of states of partially deter- mined asynchronous finite automata. (Russian) Avtomat. i Vyéisl. Tehn. 1970, no. 4, 1-7.  ...  ”, where s is the number of internal states.  ... 

Page 207 of Computational Linguistics Vol. 28, Issue 2 [page]

2002 Computational Linguistics  
special properties of the automata resulting from the intersection operation when one of the finite-state automata accepts a single string. 1.  ...  But acyclic finite-state automata have limitations: For instance, if one wants a linguistic application to accept all possible integer numbers or Internet addresses, the corresponding finite- state automaton  ... 

Multi-head Watson-Crick automata [article]

Kingshuk Chatterjee, Kumar Sankar Ray
2015 arXiv   pre-print
We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-deterministic variant of the model can accept non-regular unary languages.  ...  Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite  ...  The symbol k 1 denotes the number of heads on the upper strand and k 2 denotes the number of heads on the lower strand. The input is of the form 1 2 where 1 2 ∈WK ρ (V).  ... 
arXiv:1510.04016v2 fatcat:v6damg6uobai5j5amehfoufaei

Complexity of multi-head finite automata: Origins and directions

Markus Holzer, Martin Kutrib, Andreas Malcher
2011 Theoretical Computer Science  
Mostly, precise exponential bounds (in terms of number of states) are known for simulations of one-head finite automata by each other [19, 29, 39, 41, 49, 56] .  ...  An example of this kind is the well-known result that one-way nondeterministic finite automata can offer exponential state savings compared to one-way deterministic finite automata, that is, given an n-state  ...  Whether the input is accepted or rejected depends on the states of the automata having halting transitions. The input is accepted if at least one of them is in an accepting state. Definition 37.  ... 
doi:10.1016/j.tcs.2010.08.024 fatcat:yjkjor7r5rawrjijnxihcdnuve

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

Rashandeep Singh, Dr. Gulshan Goyal
2022 Journal of scientific research  
Computer Science and Engineering have given us the field of automata theory, one of the largest areas that is concerned with the efficiency of an algorithm in solving a problem on a computational model  ...  for acceptance or rejection of strings.  ...  It can work on any number of characters in the prefix string and any number of states.  ... 
doi:10.37398/jsr.2022.660203 fatcat:lkokfoxdn5ampku7rkmicot4ei

On Finitely Ambiguous Büchi Automata [chapter]

Christof Löding, Anton Pirogov
2018 Lecture Notes in Computer Science  
n states to finitely ambiguous automata with at most 3^n states and at most n accepting runs per word.  ...  We adapt existing notions and results concerning finite and bounded ambiguity of finite automata to the setting of ω-languages and present a translation from arbitrary nondeterministic Büchi automata with  ...  So polynomial ambiguity on finite words means that there is no constant upper bound on the number of accepting runs that holds for all words, but there is a polynomial function bounding the number of accepting  ... 
doi:10.1007/978-3-319-98654-8_41 fatcat:ydmal3bbcrg73ducvwohvdde2u

State Complexity of Reversible Watson-Crick Automata [article]

Kingshuk Chatterjee, Debayan Ganguly, Kumar Sankar Ray
2020 arXiv   pre-print
The result is interesting because conversion from non deterministic to deterministic automata results in exponential blow up of the number of states and classically increase in number of heads of the automata  ...  In this paper, we analyze the state complexity of Reversible Watson-Crick automata with respect to non-deterministic finite automata.  ...  Thus the above automaton accepts L k using just 2k+2 states. Lemma 2: Number states required for non deterministic finite automata to accept L k ={x n | n≥1, x∈{a,b} k } is greater than 2 k +1.  ... 
arXiv:2005.10126v1 fatcat:26zvv6lwffhnpj2shjw76vgfse
« Previous Showing results 1 — 15 out of 31,627 results