Generating Tokenizers with Flat Automata

Simple item page
dc.contributor.authorde Nivelle, Hans
dc.contributor.authorMuktubayeva Dina
dc.contributor.institutionSchool of Engineering and Digital Sciences, Nazarbayev University
dc.date.accessioned2025-08-27T04:58:14Z
dc.date.available2025-08-27T04:58:14Z
dc.date.issued2022-09-20
dc.description.abstractWe 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.citationHans, N., Muktubayeva, D. (2022). Generating Tokenizers with Flat Automata. Electronic Proceedings in Theoretical Computer Science. D. Della Monica and P. Ganty (Eds.): 13th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 22) EPTCS 370, 2022, pp. 66–80. https://doi.org/10.4204/eptcs.370.5en
dc.identifier.doi10.4204/eptcs.370.5
dc.identifier.urihttps://doi.org/10.4204/eptcs.370.5
dc.identifier.urihttps://nur.nu.edu.kz/handle/123456789/10487
dc.language.isoen
dc.publisherOpen Publishing Association
dc.source13th International Symposium on Games, Automata, Logics and Formal Verification (GandALF 22) EPTCS en
dc.subjectFlat Automata
dc.subjectTokenizer Generation
dc.subjectFinite Automata Representation
dc.subjectBorder Functions
dc.subjectInterval-Based Transitions
dc.titleGenerating Tokenizers with Flat Automataen
dc.typearticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
10.4204_EPTCS.370.5.pdf
Size:
169.18 KB
Format:
Adobe Portable Document Format
Download

Collections

Conference Proceedings