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

Automaticity. III: Polynomial automaticity and context-free languages

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

DOI10.1007/S000370050016zbMath0973.11031OpenAlexW2005214236MaRDI QIDQ1293361

Ian Glaister, Jeffrey O. Shallit

Publication date: 12 February 2000

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050016


zbMATH Keywords

finite automataformal languageautomaticity


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)


Related Items (2)

Automaticity. IV: Sequences, sets, and diversity ⋮ Language classes associated with automata over matrix groups







This page was built for publication: Automaticity. III: Polynomial automaticity and context-free languages

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