scientific article; zbMATH DE number 7075860

From MaRDI portal

Revision as of 08:53, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4967154

Jump to:navigation, search

zbMath1409.68161MaRDI QIDQ4967154

Giovanni Pighizzini, Martin Kutrib

Publication date: 3 July 2019

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/208/202

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

State complexity of permutation on finite languages over a binary alphabet ⋮ State Complexity of Prefix Distance ⋮ State complexity of inversion operations ⋮ Operational state complexity of unary NFAs with finite nondeterminism ⋮ State complexity of deletion and bipolar deletion ⋮ Branching Measures and Nearly Acyclic NFAs ⋮ State Complexity of Suffix Distance ⋮ Structural properties of NFAs and growth rates of nondeterminism measures ⋮ State complexity of prefix distance

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4967154&oldid=19402032"