Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tomáš Masopust
On Properties and State Complexity of Deterministic State-Partition Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Context-Free Rewriting With a Simple Restriction and Its Computational Completeness
RAIRO - Theoretical Informatics and Applications
Mathematics
Computer Science Applications
Software
Related publications
Finite-State Automata on Infinite Inputs
Divisibility and State Complexity
The Mathematica Journal
Deterministic Finite Automata
Algebra and Discrete Mathematics
Partition Logics of Automata
Il Nuovo Cimento B Series 11
State Identification Problems for Timed Automata
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Deterministic Half Automata and Boolean Mappings
Journal of Computer Science Technology Updates
Deterministic Automata Simulation, Universality and Minimality
Annals of Pure and Applied Logic
Logic
Event-Based and State-Automata-Based Modelling of FMS
SNE Simulation Notes Europe
Homological Properties of Non-Deterministic Branchings of Mergings in Higher Dimensional Automata
Homology, Homotopy and Applications
Mathematics
