In Search of Most Complex Regular Languages
From MaRDI portal
Publication:2914690
DOI10.1007/978-3-642-31606-7_2zbMath1297.68108OpenAlexW2103084752MaRDI QIDQ2914690
Publication date: 20 September 2012
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10012/12514
regular languagefinite automatonstate complexityoperationsyntactic semigroupwitnesscombined operation
Related Items (2)
On the descriptional complexity of stateless deterministic ordered restarting automata ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics
This page was built for publication: In Search of Most Complex Regular Languages