Nondeterministic syntactic complexity
From MaRDI portal
Publication:2233426
DOI10.1007/978-3-030-71995-1_23OpenAlexW3148489165MaRDI QIDQ2233426FDOQ2233426
Authors: Robert S. R. Myers, Stefan Milius, Henning Urbat 
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.03039
Cites Work
- Title not available (Why is that?)
- Derivatives of Regular Expressions
- Adjoint machines, state-behavior machines, and duality
- Title not available (Why is that?)
- On continuous nondeterminism and state minimality
- Inference of Reversible Languages
- Title not available (Why is that?)
- Minimal NFA Problems are Hard
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- The category of semilattices
- Theory of átomata
- Finite automata and unary languages
- Chrobak normal form revisited, with applications
- Primes, irreducibles and extremal lattices
- On the State Minimization of Nondeterministic Finite Automata
- Communication complexity method for measuring nondeterminism in finite automata
- Finding Lower Bounds for Nondeterministic State Complexity Is Hard
- THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
- Coalgebraic constructions of canonical nondeterministic automata
- Mathematical Foundations of Computer Science 2003
- Title not available (Why is that?)
- Representation theory of finite semigroups over semirings.
- On viewing block codes as finite automata.
- Bideterministic automata and minimal representations of regular languages
- Fuzzy machines in a category
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- Categories of algebraic contexts equivalent to idempotent semirings and domain semirings
- Discrete-time machines in closed monoidal categories. I
- The trellis structure of maximal fixed-cost codes
- Title not available (Why is that?)
- Minimal NFA and biRFSA Languages
- New Interpretation and Generalization of the Kameda-Weiner Method.
- Factor theory and the unity of opposites
- A (co)algebraic theory of succinct automata
Cited In (3)
This page was built for publication: Nondeterministic syntactic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233426)
