<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05914255</id>
  <dt>j</dt>
  <an>2011c.00219</an>
  <augroup>
    <au>Matsko, Vince</au>
  </augroup>
  <ti>Grammars and finite-state automata.</ti>
  <so>Math. Compet. 23, No. 2, 46-54 (2011).</so>
  <py>2011</py>
  <pu>Australian Mathematics Trust (AMT) Publishing, Canberra</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
    <cc>B60</cc>
    <cc>D50</cc>
    <cc>M50</cc>
    <cc>P20</cc>
  </ccgroup>
  <utgroup>
    <ut>student competitions</ut>
    <ut>mathematical olympiads</ut>
    <ut>problem posing</ut>
    <ut>special education (gifted)</ut>
    <ut>theoretical computer science</ut>
    <ut>automata theory</ut>
    <ut>formal languages</ut>
    <ut>finite-state machines</ut>
    <ut>regular expressions</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>From the introduction: The mathematics of computer science (informatics) is a rich source of problems for competitions at many levels. The aim of this paper is to provide a brief introduction to a few of these ideas.</ab>
    <rv></rv>
  </abgroup>
</item>