Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

IEEE Transactions on Automatic Control - United States
doi 10.1109/tac.2010.2046931
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Supervisor Synthesis Based on Abstractions of Nondeterministic Automata

2008English

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Finite-State Automata on Infinite Inputs

2012English

Test Suite Minimization for Embedded Nondeterministic Finite State Machines

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
1999English

Implementation of Finite State Automata Using fLIF Neurons

2008English

Simulasi Vending Machine Dengan Mengimplementasikan Finite State Automata

JOINTECS (Journal of Information Technology and Computer Science)
2018English

Testing Nondeterministic Finite State Machines With Respect to the Separability Relation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Finite-State Registered Automata for Non-Concatenative Morphology

Computational Linguistics
LinguisticsComputer Science ApplicationsArtificial IntelligenceLanguage
2006English

Finite-State Registered Automata and Their Uses in Natural Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy