scientific article
From MaRDI portal
Publication:3086930
zbMath1217.68133MaRDI QIDQ3086930
Sylvain Lombardy, Jacques Sakarovitch
Publication date: 30 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (13)
The universal fuzzy automaton ⋮ Language-theoretic and finite relation models for the (full) Lambek calculus ⋮ A polynomial double reversal minimization algorithm for deterministic finite automata ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ Some more algorithms for Conway's universal automaton ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus ⋮ Theory of átomata ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Some more on the basis finite automaton ⋮ Minimisation of automata ⋮ Yet another canonical nondeterministic automaton
This page was built for publication:
