Amanote Research

Amanote Research

    RegisterSign In

Finite-State Automata on Infinite Inputs

doi 10.1142/9789814271059_0002
Full Text
Open PDF
Abstract

Available in full text

Date

July 1, 2012

Authors
Madhavan Mukund
Publisher

Co-Published with Indian Institute of Science (IISc), Bangalore, India


Related search

Simulasi Vending Machine Dengan Mengimplementasikan Finite State Automata

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

Finite-State Registered Automata for Non-Concatenative Morphology

Computational Linguistics
LinguisticsComputer Science ApplicationsArtificial IntelligenceLanguage
2006English

Implementation of Finite State Automata Using fLIF Neurons

2008English

Checking Experiments for Finite State Machines With Symbolic Inputs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Decidable Problems for Probabilistic Automata on Infinite Words

2012English

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2010English

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

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

Privacy PolicyRefund Policy