Results 121 to 130 of about 17,250 (168)

Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference

Fundamenta Informaticae, 2021
The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA).
Tomasz Jastrząb, Z. Czech, Wojciech Wieczorek   +2 more
semanticscholar   +1 more source

Syntactic Minimization of Nondeterministic Finite Automata

International Symposium on Mathematical Foundations of Computer Science, 2021
Nondeterministic automata may be viewed as succinct programs implementing deterministic automata, i.e. complete specifications. Converting a given deterministic automaton into a small nondeterministic one is known to be computationally very hard; in fact,
R. Myers, Henning Urbat
semanticscholar   +1 more source

Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm

International Symposium on Parallel and Distributed Computing, 2020
The goal of this paper is to develop a parallel algorithm that, on input of a learning sample, identifies a regular language by means of a nondeterministic finite automaton (NFA).
Tomasz Jastrząb, Z. Czech, Wojciech Wieczorek   +2 more
semanticscholar   +1 more source

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)

International Symposium on Fundamentals of Computation Theory
Complementation of finite automata is a basic operation used in numerous applications. The standard way to complement a nondeterministic finite automaton (NFA) is to transform it into an equivalent deterministic finite automaton (DFA) and complement the ...
L. Holík, Ondřej Lengál, Juraj Major, Adéla Stepková, Jan Strejcek   +4 more
semanticscholar   +1 more source

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata

arXiv.org
This paper establishes a lower bound on the number of states necessary in the worst case to simulate an $n$-state two-way nondeterministic finite automaton (2NFA) by a one-way unambiguous finite automaton (UFA).
Semyon Petrov, Alexander Okhotin
semanticscholar   +1 more source

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata

arXiv.org
We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a nondeterministic extension of 2NFAs still characterizing regular ...
B. Guillon, Luca Prigioniero, Javad Taheri   +2 more
semanticscholar   +1 more source

Nondeterministic to Deterministic Finite-State Machine Visualization: Implementation and Evaluation

Annual Conference on Innovation and Technology in Computer Science Education
The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory.
Marco T. Morazán, Tijana Minić
semanticscholar   +1 more source

An Online Human-Aware Behavior Planning Method for Nondeterministic UAV System Under Probabilistic Model Checking

Drones
This paper proposes an online human-aware behavior planning method to enable Unmanned Aerial Vehicles (UAVs) to dynamically satisfy high-level linear temporal logic (LTL) task descriptions from human collaborators.
Jiancheng Zhu, Peng Wang, Yong Peng, Quanjun Yin   +3 more
semanticscholar   +1 more source

Construction of Automaton Observer Based on Matrix Semi-Tensor Product

Chinese Control and Decision Conference
The Finite State Machine (FSM) is a foundational model in computer science and formal language theory, with extensive applications in pattern recognition, compiler design and natural language processing. However, the conversion of Nondeterministic Finite
Zhaohe An, Yongyi Yan, Jumei Yue, Xiaobo Li   +3 more
semanticscholar   +1 more source