Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2715768
Jump to:navigation, search

zbMath0963.68093MaRDI QIDQ2715768

No author found.

Publication date: 22 May 2001


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

zbMATH Keywords

PapersMeetingTheoretical computer scienceSmolenice (Czechoslovakia)


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Artificial intelligence for robotics (68T40)


Related Items (5)

The multi-spreader crane scheduling problem: partitions and supersequences ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ Decidability of code properties ⋮ Scheduling tasks on a flexible manufacturing machine to minimize tool change delays ⋮ Sequential grammars and automata with valences




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2715768&oldid=15568861"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki