Filters








21,831 Hits in 3.8 sec

Treatment of Epsilon Moves in Subset Construction

Gertjan van Noord
2000 Computational Linguistics  
The paper identifies and compares a number of subset construction algorithms that treat c-moves.  ...  efficiency.  ...  Acknowledgments I am grateful to Mark-Jan Nederhof for support, and for providing me with lots of (often dreadful) automata generated by his finite-state approximation tools.  ... 
doi:10.1162/089120100561638 fatcat:mtbu73dtkvhjpayjsiwqo43nzq

A Novel Algorithm for Reduction of Non-Deterministic Finite Automata

G. Mutyalamma, K. Komali, G. Pushpa
2017 International Journal of Trend in Scientific Research and Development  
So a minimal NFA is a primal problem in automata theory. We consider the problem of approximating a minimal NFA or a minimal regular expression.  ...  There are several approaches to NFA minimization either without approximation guarantees or running in at least exponential time.  ...  Our opinion is that the most interesting algorithm is the one based on the first-order approximation, which has a reasonable worst case complexity, and should prove to be very fast in s the most efficient  ... 
doi:10.31142/ijtsrd8233 fatcat:wwxaf2mnbjhuvkppn6dp4qpovm

Approximate Automata for Omega-Regular Languages [chapter]

Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah
2019 Lecture Notes in Computer Science  
We study the state complexity of different types of approximating automata, and provide constructions for the approximation within different automata classes, for example, for approximating a given automaton  ...  These characteristics play a crucial role in applications of automata theory. For example, certain acceptance conditions can be handled more efficiently than others by dedicated tools and algorithms.  ...  Our approximation exploits the same idea for the construction and transformation of automata.  ... 
doi:10.1007/978-3-030-31784-3_19 fatcat:zcjr6h7wcvhdrnmxz6mq6xwdde

Page 75 of Computational Linguistics Vol. 26, Issue 1 [page]

2000 Computational Linguistics  
van Noord Epsilon Moves in Subset Construction Automata produced by finite-state approximation techniques tend to contain many e-moves.  ...  Efficient approaches to subset construction. Master’s thesis, Computer Science, University of Waterloo. Miller, George and Noam Chomsky. 1963. Finitary models of language users. In R. Luce, R.  ... 

Treatment of Epsilon-Moves in Subset Construction [article]

Gertjan van Noord
1998 arXiv   pre-print
Experiments with finite-state approximations of natural language grammars often give rise to very large automata with a very large number of epsilon-moves.  ...  The paper discusses the problem of determinising finite-state automata containing large numbers of epsilon-moves.  ...  Acknowledgements I am grateful to Mark-Jan Nederhof for support, and for providing me with lots of (often dreadful) automata generated by his finite-state approximation tools.  ... 
arXiv:cmp-lg/9804003v1 fatcat:rysl2xvqwzbqddmsobcwvuxj2e

Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA

CORINNA CORTES, MEHRYAR MOHRI, ASHISH RASTOGI
2007 International Journal of Foundations of Computer Science  
Similar techniques to those used for computing the Lp distance also yield efficient algorithms for computing the Hellinger distance of two unambiguous probabilistic automata both exactly and approximately  ...  It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results  ...  Acknowledgments The research of Mehryar Mohri and Ashish Rastogi was partially supported by the New York State Office of Science Technology and Academic Research (NYS-TAR).  ... 
doi:10.1142/s0129054107004966 fatcat:hmsy6eudgrccfmuyipficdrm4u

Lazy Automata Techniques for WS1S [article]

Tomáš Fiedor, Lukáš Holík, Petr Janků, Ondřej Lengál, Tomáš Vojnar
2017 arXiv   pre-print
The pruning is done by a generalization of two techniques used in antichain-based language inclusion and universality checking of finite automata: subsumption and early termination.  ...  The main novelty is to test the emptiness on the fly, while constructing a symbolic, term-based representation of the automaton, and prune the constructed state space from parts irrelevant to the test.  ...  This work was supported by the Czech Science Foundation (projects 14-11384S, 16-17538S, and 16-24707Y), the BUT FIT project FIT-S-17-4014, and the IT4IXS: IT4Innovations Excellence in Science project (  ... 
arXiv:1701.06282v2 fatcat:k5w45yi5znc5rh6fq5cqwvdwy4

Lazy Automata Techniques for WS1S [chapter]

Tomáš Fiedor, Lukáš Holík, Petr Janků, Ondřej Lengál, Tomáš Vojnar
2017 Lecture Notes in Computer Science  
The pruning is done by a generalization of two techniques used in antichain-based language inclusion and universality checking of finite automata: subsumption and early termination.  ...  The main novelty is to test the emptiness on the fly, while constructing a symbolic, term-based representation of the automaton, and prune the constructed state space from parts irrelevant to the test.  ...  This work was supported by the Czech Science Foundation (projects 14-11384S, 16-17538S, and 16-24707Y), the BUT FIT project FIT-S-17-4014, and the IT4IXS: IT4Innovations Excellence in Science project (  ... 
doi:10.1007/978-3-662-54577-5_24 fatcat:nyebae6pejhhhokccc2pipxp7m

Probabilistic automata of bounded ambiguity

Nathanaël Fijalkow, Cristian Riveros, James Worrell
2020 Information and Computation  
Our main contributions are to construct efficient algorithms for analysing finitely ambiguous probabilistic automata through a reduction to a multi-objective optimisation problem called the stochastic  ...  We obtain a polynomial time algorithm for approximating the value of probabilistic automata of fixed ambiguity and a quasi-polynomial time algorithm for the emptiness problem for 2-ambiguous probabilistic  ...  Acknowledgements We thank Shaull Almagor for reporting a mistake in the proof (and statement) of Theorem 5.  ... 
doi:10.1016/j.ic.2020.104648 fatcat:d2d2ijbuobazrl7dfyutrs7jbu

On the Computation of Some Standard Distances Between Probabilistic Automata [chapter]

Corinna Cortes, Mehryar Mohri, Ashish Rastogi
2006 Lecture Notes in Computer Science  
We give efficient exact and approximate algorithms for computing these distances for p even and prove the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results  ...  Finally, we also describe an efficient algorithm for testing the equivalence of two arbitrary probabilistic automata A1 and A2 based on Schützenberger's standardization with a running time complexity of  ...  This work was partially funded by the New York State Office of Science Technology and Academic Research (NYSTAR) and was also sponsored in part by the Department of the Army Award Number W23RYX-3275-N605  ... 
doi:10.1007/11812128_14 fatcat:vummb2qbfjgudjgvtnbemzyyv4

Checking Timed Büchi Automata Emptiness Using LU-Abstractions [chapter]

Guangyuan Li
2009 Lecture Notes in Computer Science  
A tool with LUextrapolation for emptiness checking of timed Büchi automata has been implemented, and some experiments are reported.  ...  This paper shows that the zone-based LU-extrapolation of Behrmann et al, that preserves reachability of timed automata, also preserves emptiness of timed Büchi automata.  ...  In this paper we will show that the LU-extrapolation preserves the emptiness of timed Büchi automata and can be used efficiently in the emptiness checking of timed Büchi automata.  ... 
doi:10.1007/978-3-642-04368-0_18 fatcat:fdsn5nwnyzgrhkbgxmi2744zle

APEX: An Analyzer for Open Probabilistic Programs [chapter]

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012 Lecture Notes in Computer Science  
APEX can then further analyse the produced automata; in particular, it can check two automata for equivalence which translates to equivalence of the corresponding programs under all environments.  ...  The translation is compositional and effectively leverages state reduction techniques.  ...  Language equivalence between probabilistic automata reduces to a linear-algebra problem for which efficient algorithms have been developed, see [5] and the references therein.  ... 
doi:10.1007/978-3-642-31424-7_51 fatcat:43x4hdge7rds5ix6tb7iggayna

ACTAS : A System Design for Associative and Commutative Tree Automata Theory

Hitoshi Ohsaki, Toshinori Takai
2005 Electronical Notes in Theoretical Computer Science  
In order to deal with high-complexity problems in reasonable time, over-and under-approximation algorithms are also equipped.  ...  ACTAS is an integrated system for manipulating associative and commutative tree automata (AC-tree automata for short), that has various functions such as for Boolean operations of AC-tree automata, computing  ...  The authors thank the three anonymous referees for their numerous comments and suggestions to improve the early version of the paper.  ... 
doi:10.1016/j.entcs.2004.07.017 fatcat:2bcqwbcqsnfttnu4hrcli2kr74

Towards Efficient Dissemination of Linked Data in the Internet of Things

Yongrui Qin, Quan Z. Sheng, Nickolas J.G. Falkner, Ali Shemshadi, Edward Curry
2014 Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management - CIKM '14  
Two new data structures, namely MVR-tree and TP-automata, are introduced to suit these types of matching respectively.  ...  To efficiently match BGPs against Linked Data streams, we introduce two types of matching, namely semantic matching and pattern matching, by considering whether the matching process supports semantic relatedness  ...  Then a suitable index will be constructed for efficient evaluation between Linked Data streams and user queries.  ... 
doi:10.1145/2661829.2661889 dblp:conf/cikm/QinSFSC14 fatcat:vxvht5ly6bfa5a66gvsojv4ium

Non Homogeneous Rough Finite State Automaton

B. Praba, R. Saranya
2021 Revista GEINTEC  
For each time 't' we generate lower approximation rough finite state automaton Mt_ and the upper approximation rough finite state automaton Mt- and the defined concepts are elaborated with suitable examples  ...  Methodology: With the aid of Rough finite state automata we define the concept of non-homogeneous rough finite state automata.  ...  Acknowledgement The authors thank the Management, SSN Institutions and the Principal for the completion of this paper and providing encouragement and support to carry out the research.  ... 
doi:10.47059/revistageintec.v11i2.1700 fatcat:je3vemoxqnd7lcoeqjeegi3wia
« Previous Showing results 1 — 15 out of 21,831 results