MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

DOI10.1142/S0129054105003431zbMath1090.68063MaRDI QIDQ5704379

Libor Polák

Publication date: 14 November 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Related Items (10)

The universal fuzzy automaton ⋮ Obituary: Libor Polák (1950--2020) ⋮ EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM ⋮ A polynomial double reversal minimization algorithm for deterministic finite automata ⋮ On quotients of formal power series ⋮ Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA ⋮ FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES

Cites Work

• A note on the space complexity of some decision problems for finite automata
• On the State Minimization of Nondeterministic Finite Automata
• Unnamed Item

This page was built for publication: MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON