State Complexity and Limited Nondeterminism

DOI10.1007/978-3-642-31623-4_20zbMath1304.68117OpenAlexW48869925MaRDI QIDQ3167587

Selim G. Akl, Kai Salomaa, Alexandros Palioudakis

Publication date: 2 November 2012

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31623-4_20

zbMATH Keywords

finite automatastate complexitylimited nondeterminismlanguage operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Operational state complexity of unary NFAs with finite nondeterminism ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Nondeterministic Tree Width of Regular Languages

This page was built for publication: State Complexity and Limited Nondeterminism