Generating Tokenizers with Flat Automata

dc.contributor.author	de Nivelle Hans
dc.contributor.author	Muktubayeva Dina
dc.date.accessioned	2025-08-27T04:58:14Z
dc.date.available	2025-08-27T04:58:14Z
dc.date.issued	2022-09-20
dc.description.abstract	We introduce flat automata for automatic generation of tokenizers. Flat automata are a simple representation of standard finite automata. Using the flat representation, automata can be easily constructed, combined and printed. Due to the use of border functions, flat automata are more compact than standard automata in the case where intervals of characters are attached to transitions, and the standard algorithms on automata are simpler.	en
dc.identifier.citation	de Nivelle Hans; Muktubayeva Dina. (2022). Generating Tokenizers with Flat Automata. Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/eptcs.370.5	en
dc.identifier.doi	10.4204/eptcs.370.5
dc.identifier.uri	https://doi.org/10.4204/eptcs.370.5
dc.identifier.uri	https://nur.nu.edu.kz/handle/123456789/10487
dc.language.iso	en
dc.publisher	Open Publishing Association
dc.source	(2022)	en
dc.title	Generating Tokenizers with Flat Automata	en
dc.type	article	en

Files

Now showing 1 - 1 of 1