Assisted Problem Solving and Decompositions of Finite Automata

DOI10.1007/978-3-540-77566-9_25zbMath1133.68072arXiv0707.0430OpenAlexW1591406089MaRDI QIDQ5448655

Branislav Rovan, Peter Gaži

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.0430

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

On Usefulness of Information: Framework and NFA Case ⋮ Modeling time criticality of information ⋮ Usefulness of information and unary languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection and union of regular languages and state complexity
• The complexity of promise problems with applications to public-key cryptography