The universal automaton
From MaRDI portal
Publication:3086930
zbMATH Open1217.68133MaRDI QIDQ3086930FDOQ3086930
Authors: Sylvain Lombardy, Jacques Sakarovitch 
Publication date: 30 March 2011
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)
Cited In (32)
- The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
- Some more algorithms for Conway's universal automaton
- Construction of finite universal automata. II: Examples of functioning of the algorithms
- Title not available (Why is that?)
- Yet another canonical nondeterministic automaton
- The universal fuzzy automaton
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
- Minimisation of automata
- On the existence of universal finite or pushdown automata
- On an algorithm of constructing Conway's universal automaton
- Construction of universal finite automata. I: From theorem to the practical algorithms
- Language-theoretic and finite relation models for the (full) Lambek calculus
- Factorizations and universal automaton of omega languages
- Factorizations and universal automaton of omega languages
- A sufficient condition to polynomially compute a minimum separating DFA
- Title not available (Why is that?)
- Polynomial inference of universal automata from membership and equivalence queries
- Automatic concepts and automata-theoretic semantics for the full Lambek calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification: Theory and Practice
- Title not available (Why is that?)
- Approximate NFA universality and related problems motivated by information theory
- Implementation and Application of Automata
- Title not available (Why is that?)
- Theory of átomata
- Yet another canonical nondeterministic automaton
- Coalgebraic constructions of canonical nondeterministic automata
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- A polynomial double reversal minimization algorithm for deterministic finite automata
- Some more on the basis finite automaton
- On the Size of the Universal Automaton of a Regular Language
This page was built for publication: The universal automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086930)
