Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W183058569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Challenging Family of Automata for Classical Minimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Sturmian words and Hopcroft's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal cases of Hopcroft's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal simulation of self-verifying automata by deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Minimization of Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization algorithms for sequential transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Evaluation of Classical Automata Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848749 / rank
 
Normal rank

Latest revision as of 09:10, 4 July 2024

scientific article; zbMATH DE number 5934382
Language Label Description Also known as
English
Nondeterministic Moore Automata and Brzozowski’s Algorithm
scientific article; zbMATH DE number 5934382

    Statements