On Properties and State Complexity of Deterministic State-Partition Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-33475-7_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Finite-State Automata on Infinite Inputs

2012English

Divisibility and State Complexity

The Mathematica Journal
2010English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Partition Logics of Automata

Il Nuovo Cimento B Series 11
1994English

State Identification Problems for Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Deterministic Half Automata and Boolean Mappings

Journal of Computer Science Technology Updates
2015English

Deterministic Automata Simulation, Universality and Minimality

Annals of Pure and Applied Logic
Logic
1997English

Event-Based and State-Automata-Based Modelling of FMS

SNE Simulation Notes Europe
2010English

Homological Properties of Non-Deterministic Branchings of Mergings in Higher Dimensional Automata

Homology, Homotopy and Applications
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy