Nondeterministic syntactic complexity
From MaRDI portal
Publication:2233426
DOI10.1007/978-3-030-71995-1_23OpenAlexW3148489165MaRDI QIDQ2233426
Robert S. R. Myers, Stefan Milius, Henning Urbat
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.03039
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On continuous nondeterminism and state minimality
- Representation theory of finite semigroups over semirings.
- Bideterministic automata and minimal representations of regular languages
- Coalgebraic constructions of canonical nondeterministic automata
- Finite automata and unary languages
- Primes, irreducibles and extremal lattices
- Discrete-time machines in closed monoidal categories. I
- Adjoint machines, state-behavior machines, and duality
- On viewing block codes as finite automata.
- Communication complexity method for measuring nondeterminism in finite automata
- Factor theory and the unity of opposites
- A (co)algebraic theory of succinct automata
- Theory of átomata
- The category of semilattices
- Categories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings
- The trellis structure of maximal fixed-cost codes
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard
- Minimal NFA and biRFSA Languages
- Inference of Reversible Languages
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
- Fuzzy machines in a category
- Minimal NFA Problems are Hard
- New Interpretation and Generalization of the Kameda-Weiner Method.
- Chrobak Normal Form Revisited, with Applications
- Mathematical Foundations of Computer Science 2003
- On the State Minimization of Nondeterministic Finite Automata
- Derivatives of Regular Expressions
- Antichains: A New Algorithm for Checking Universality of Finite Automata
This page was built for publication: Nondeterministic syntactic complexity
