The universal automaton

MaRDI QIDQ3086930zbMATH OpenFDO

Authors Sylvain Lombardy, Jacques Sakarovitch

Publication date 30 March 2011

zbMATH Keywords

morphismsregular languagessoundnesssurvey articleuniversal automaton

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45)

Recommendations

• On the Size of the Universal Automaton of a Regular Language
• scientific article; zbMATH DE number 2086220
• Implementation and Application of Automata
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• Construction of universal finite automata. I: From theorem to the practical algorithms

Cited in

(32)

• Minimisation of automata
• Yet another canonical nondeterministic automaton
• A sufficient condition to polynomially compute a minimum separating DFA
• Language-theoretic and finite relation models for the (full) Lambek calculus
• Theory of átomata
• The universal fuzzy automaton
• The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages
• On an algorithm of constructing Conway's universal automaton
• Automatic concepts and automata-theoretic semantics for the full Lambek calculus
• scientific article; zbMATH DE number 2086220 (Why is no real title available?)
• On the Size of the Universal Automaton of a Regular Language
• scientific article; zbMATH DE number 4112026 (Why is no real title available?)
• A polynomial double reversal minimization algorithm for deterministic finite automata
• Some more algorithms for Conway's universal automaton
• scientific article; zbMATH DE number 2040924 (Why is no real title available?)
• scientific article; zbMATH DE number 2053215 (Why is no real title available?)
• scientific article; zbMATH DE number 860126 (Why is no real title available?)
• Some more on the basis finite automaton
• On the existence of universal finite or pushdown automata
• Construction of universal finite automata. I: From theorem to the practical algorithms
• scientific article; zbMATH DE number 7301805 (Why is no real title available?)
• Construction of finite universal automata. II: Examples of functioning of the algorithms
• Factorizations and universal automaton of omega languages
• Factorizations and universal automaton of omega languages
• Verification: Theory and Practice
• Implementation and Application of Automata
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
• Approximate NFA universality and related problems motivated by information theory
• 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
• Polynomial inference of universal automata from membership and equivalence queries

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)