scientific article
From MaRDI portal
Publication:4005202
zbMath0751.68038MaRDI QIDQ4005202
Maurice Nivat, Anne Dicky, André Arnold
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The universal fuzzy automaton, On quotients of formal power series, On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes, Finite \(L\)-fuzzy machines., Theory of átomata, A lower bound technique for the size of nondeterministic finite automata, Studying equivalences of transition systems with algebraic tools, Universal automata and NFA learning, Introducing VAUCANSON, Bideterministic automata and minimal representations of regular languages, On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's, The Cayley-Hamilton Theorem for Noncommutative Semirings, Finite Automata as Time-Inv Linear Systems Observability, Reachability and More, Minimal NFA and biRFSA Languages, Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference, Minimisation of automata, Descriptional complexity of regular languages, Computational complexity of problems for deterministic presentations of sofic shifts
