✦ LIBER ✦

Problem solving in automata, languages, and complexity

✍ Scribed by Ding-Zhu Du; Ko, K.-I.

Book ID: 114577678
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 180 KB
Volume: 20
Category: Article
ISSN: 8755-3996
DOI: 10.1109/mcd.2004.1317948

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizable trace languages, distribute

Recognizable trace languages, distributed automata and the distribution problem

✍ Antoine Petit 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 753 KB

On the complexity of recursion in proble

On the complexity of recursion in problem-solving

✍ M.C. Er 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 426 KB

The importance of paying attention to the complexity of recursion in problem solving is stressed. Many ill-founded beliefs and doctrines on constructing recursive algorithms are challenged. The Tower of Hanoi problem and its variant are used as concrete examples for illustrating that many seemingly

A Language and Philosophy for Solving Pr

A Language and Philosophy for Solving Problems

✍ Brodie, Leo 📂 Fiction 📅 0 🌐 English ⚖ 4 MB

Ethical Problem Solving and Systems Theo

Ethical Problem Solving and Systems Theory: The Complexity Connection

✍ David X. Swenson; David Rigoni 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 768 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 85 || The complexity of the inequivalence problem for regular expressions with intersection

✍ Bakker, Jaco; Leeuwen, Jan 📂 Article 📅 1980 🏛 Springer Berlin Heidelberg ⚖ 681 KB

Logical Complexity of Some Classes of Tr

Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata

✍ Wojciech Buszkowski 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ