scientific article; zbMATH DE number 4001492

From MaRDI portal

Revision as of 21:18, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4727438

Jump to:navigation, search

zbMath0617.68055MaRDI QIDQ4727438

Andreas Weber, Helmut Seidl

Publication date: 1986

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

zbMATH Keywords

polynomial-time algorithm nondeterministic finite automaton degree of ambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

New techniques for proving the decidability of equivalence problem ⋮ On the degree of ambiguity of finite automata ⋮ The parallel complexity of finite-state automata problems ⋮ Queries on XML streams with bounded delay and concurrency ⋮ On finitely generated monoids of matrices with entries in $\mathbb {N}$ ⋮ Bounded Delay and Concurrency for Earliest Query Answering

This page was built for publication:

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