The following pages link to (Q4005202):
Displaying 21 items.
- The universal fuzzy automaton (Q279373) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- Studying equivalences of transition systems with algebraic tools (Q673968) (← links)
- Introducing VAUCANSON (Q703498) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- Universal automata and NFA learning (Q954990) (← links)
- Finite \(L\)-fuzzy machines. (Q1426247) (← links)
- Minimisation of automata (Q2074212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Theory of átomata (Q2453119) (← links)
- On quotients of formal power series (Q2672254) (← links)
- The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system (Q2855521) (← links)
- The Cayley-Hamilton Theorem for Noncommutative Semirings (Q3073632) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Finite Automata as Time-Inv Linear Systems Observability, Reachability and More (Q3624572) (← links)
- Minimal NFA and biRFSA Languages (Q3625690) (← links)
- On the Construction of a Family of Automata That Are Generically Non-minimal (Q4910445) (← links)
- Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference (Q4989176) (← links)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines (Q5268394) (← links)
