Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Peter Kostolányi"'
Autor:
Peter Kostolányi
Publikováno v:
Theory of Computing Systems. 67:291-309
Autor:
Peter Kostolányi
Publikováno v:
Theoretical Computer Science. 898:110-131
Weighted finite automata over the field of rational numbers and unary alphabets are considered. The notion of a characteristic polynomial is introduced for such automata as a means to provide a decidable necessary and sufficient condition, under whic
Autor:
Peter Kostolányi
Publikováno v:
Theoretical Computer Science. 867:101-127
The theory of finite automata and rational semiring elements is reconsidered in the setting of summation semirings, traditionally known as Σ-semirings. These generalise complete semirings by allowing infinite sums to be defined just for selected fam
Autor:
Peter Kostolányi
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783031095733
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f39f60bb10f0bd50efd258194c6f78b2
https://doi.org/10.1007/978-3-031-09574-0_13
https://doi.org/10.1007/978-3-031-09574-0_13
Autor:
Peter Kostolányi
Publikováno v:
Algebraic Informatics ISBN: 9783031196843
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::234156116824e86e462fc5a09a7cec6a
https://doi.org/10.1007/978-3-031-19685-0_12
https://doi.org/10.1007/978-3-031-19685-0_12
Autor:
Peter Kostolányi
Publikováno v:
Information Processing Letters. 179:106290
Autor:
Peter Kostolányi, Ondřej Klíma
Publikováno v:
Information and Computation. 288:104709
A recently introduced operation of geometrical closure on formal languages is investigated from the viewpoint of algebraic language theory. Positive varieties V containing exclusively languages with regular geometrical closure are fully characterised
Autor:
Peter Kostolányi
Publikováno v:
Information Processing Letters. 140:42-47
Two families of input-deterministic weighted automata over semirings are considered: purely sequential automata, in which terminal weights of states are either zero or unity, and sequential automata, in which states can have arbitrary terminal weight
Autor:
Peter Kostolányi
Publikováno v:
Theory of Computing Systems. 63:615-633
A fairly general definition of canonical solutions to algebraic systems over semirings is proposed. This is based on the notion of summation semirings, traditionally known as ${\Sigma }$ -semirings, and on assigning unambiguous context-free languages
Autor:
Peter Kostolányi, Ondřej Klíma
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030406073
LATA
LATA
A recently introduced operation of geometrical closure on formal languages is investigated. It is proved that the geometrical closure of a language from the positive variety \(\mathcal {V}_{3/2}\), the level 3/2 of the Straubing-Therien hierarchy of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d3e0b0afe611497864e3ddc38bb2121
https://doi.org/10.1007/978-3-030-40608-0_23
https://doi.org/10.1007/978-3-030-40608-0_23